TY - GEN
T1 - Routing non-convex grids without holes
AU - Parks, D.
AU - Truszczynski, M.
PY - 1991
Y1 - 1991
N2 - This paper is part of a complete solution of the two-terminal net routing problem for certain non-convex grids without holes that the authors call Z-grids, that part being the embedding of a non-even Z-grid routing problem in an even Z-grid routing problem. This embedding algorithm runs in time O(b), where b is the size of the boundary.
AB - This paper is part of a complete solution of the two-terminal net routing problem for certain non-convex grids without holes that the authors call Z-grids, that part being the embedding of a non-even Z-grid routing problem in an even Z-grid routing problem. This embedding algorithm runs in time O(b), where b is the size of the boundary.
UR - http://www.scopus.com/inward/record.url?scp=85040731298&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85040731298&partnerID=8YFLogxK
U2 - 10.1109/GLSV.1991.143959
DO - 10.1109/GLSV.1991.143959
M3 - Conference contribution
AN - SCOPUS:85040731298
T3 - Proceedings - 1st Great Lakes Symposium on VLSI, GLSV 1991
SP - 157
EP - 162
BT - Proceedings - 1st Great Lakes Symposium on VLSI, GLSV 1991
Y2 - 1 March 1991 through 2 March 1991
ER -