Complexity of Single-Layer Routing

IEEE Transactions on Computers

Volumn C-33, Issue 3, 1984, Pages 286-288

  Richards, Dana ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

NP completeness; planar graphs; single layer routing; vertex disjoint paths; VLSI design

Indexed keywords

INTEGRATED CIRCUITS, VLSI;

EID: 0021385797     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1984.1676428     Document Type: Article

References (8)

1. F. D. Berman, F. T. Leighton, and L. Snyder, “Optimal tile salvage,” Purdue Univ., W. Lafayette, IN, Tech. Rep. TR-396, 1982.
2. M. Garey and S. Johnson, Computers and Intractability. San Frarisisco, CA: Freeman, 1979, p. 217.
3. M. R. Kramer and J. van Leeuwen, “Wire-routing is NP-complete,” Univ. of Utrecht, The Netherlands, Tech. Rep. RUU-CS-82-4, 1982.
4. A. LaPaugh, “Algorithms for integrated circuit layout,” Ph.D. dissertation, Massachusetts Inst. Technol., Cambridge, MA, Nov. 1980.
5. D. Lichtenstein, “Planar formulae and their uses,” SIAM J. Comput., vol. 11, pp. 329–343, 1982.
6. J. F. Lynch, “The equivalence of theorem proving and the intraconnection problem,” ACM SIGDA Newslett., vol. 5, no. 3, 31–65, 1975.
7. J. F. Lynch, unpublished, 1976.
8. R. Raghavan, J. Cohoon, and S. Sahni, “Manhattan and rectilinear wiring,” Univ. of Minnesota, Minneapolis, MN, Tech Rep. TR 81–5, 1981.