DocumentCode
3618832
Title
Routing non-convex grids without holes
Author
D. Parks;M. Truszczynski
Author_Institution
Transylvania Univ., Lexington, KY, USA
fYear
1991
fDate
6/13/1905 12:00:00 AM
Firstpage
157
Lastpage
162
Abstract
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.
Keywords
"Routing","Computer science","Shape"
Publisher
ieee
Conference_Titel
VLSI, 1991. Proceedings., First Great Lakes Symposium on
Print_ISBN
0-8186-2170-2
Type
conf
DOI
10.1109/GLSV.1991.143959
Filename
143959
Link To Document