Republic of Singapore.
by Andrew Lim, Sartaj Sahni, Venkat Thanvantri
ftp://ftp.cis.ufl.edu/pub/tech-reports/tr94/tr94-012.ps.Z
Add To MetaCart
Abstract:
We develop a simple linear time algorithm to determine if a collection of two pin nets can be routed, topologically, in a plane (i.e. single layer). Experiments indicate that this algorithm is faster than the linear time algorithm of Marek-Sadowska and Tarng[1].
Citations
| 7716 | Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 168 | Efficient planarity testing – Hopcroft, Tarjan - 1974 |
| 16 | Optimal placement for river routing – Leiserson, Pinter - 1983 |
| 11 | River Routing in VLSI – Mirzaian - 1987 |
| 10 | On routing two-point nets across a channel – Pinter - 1982 |
| 10 | River-routing: Methodology and analysis – Pinter - 1983 |
| 7 | General River Routing Algorithm – Hsu - 1983 |
| 3 | Single-Layer Routing for VLSI: Analysis and Algorithms – Marek-Sadowska, Tarng - 1983 |
| 3 | Optimal Joining of Compacted Cells – Lim, Cheng, et al. - 1991 |
| 3 | A Minimum Separation Algorithm for River Routing with Bounded Number of Jogs – Mirzaian - 1989 |
| 3 | The separation for general single layer wiring barriers – Siegel, Dolev - 1981 |
| 3 | River Routing with Small Number of Jogs – Tuan, Hakimi - 1990 |
| 3 | On River Routing with Minimum Number of Jogs – Tuan, Teo - 1991 |
