The Community for Technology Leaders
Proceedings of the Second Great Lakes Symposium on VLSI (1992)
Kalamazoo, MI, USA
Feb. 28, 1992 to Feb. 29, 1992
ISBN: 0-8186-2610-0
pp: 152-158
D. Parks , Math. Sci., Appalachian State Univ., Boone, NC, USA
ABSTRACT
The authors present part of a complete solution of a two-terminal net routing problem for certain non-convex grids without holes that they call channel graphs. They present an algorithm for embedding a non-even channel graph routing problem in an even channel graph routing problem. They refer to the algorithm as EMBED. EMBED runs in time O(b), where b is the number of vertices on the boundary, and is similar to an algorithm described by M. Becker and K. Mehlhorn (1986) for planar graphs. Due to the restrictions the authors place on the shape of channel graph routing problems they are able to obtain a lower complexity for their algorithm than that of the Becker and Mehlhorn algorithm. Their algorithm has complexity O(bn), where n is the number of vertices in the graph.<>
INDEX TERMS
circuit layout CAD, computational complexity
CITATION

D. Parks and M. Truszczynski, "An algorithm for embedding a class of non-even routing problems in even routing problems," Proceedings of the Second Great Lakes Symposium on VLSI(GLSV), Kalamazoo, MI, USA, , pp. 152-158.
doi:10.1109/GLSV.1992.218351
83 ms
(Ver 3.3 (11022016))