Routing non-convex grids without holes

D. Parks; M. Truszczynski

doi:10.1109/GLSV.1991.143959

Routing non-convex grids without holes

D. Parks, M. Truszczynski

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	Proceedings - 1st Great Lakes Symposium on VLSI, GLSV 1991
Pages	157-162
Number of pages	6
ISBN (Electronic)	0818621702, 9780818621703
DOIs	https://doi.org/10.1109/GLSV.1991.143959
State	Published - 1991
Event	1st Great Lakes Symposium on VLSI, GLSV 1991 - Kalamazoo, United States Duration: Mar 1 1991 → Mar 2 1991

Publication series

Name	Proceedings - 1st Great Lakes Symposium on VLSI, GLSV 1991

Conference

Conference	1st Great Lakes Symposium on VLSI, GLSV 1991
Country/Territory	United States
City	Kalamazoo
Period	3/1/91 → 3/2/91

Bibliographical note

Publisher Copyright:
© 1991 IEEE.

ASJC Scopus subject areas

Hardware and Architecture
Electrical and Electronic Engineering
Control and Systems Engineering

Access to Document

10.1109/GLSV.1991.143959

Cite this

@inproceedings{1caa06f017e04500937800d5672d12dd,

title = "Routing non-convex grids without holes",

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.",

author = "D. Parks and M. Truszczynski",

note = "Publisher Copyright: {\textcopyright} 1991 IEEE.; 1st Great Lakes Symposium on VLSI, GLSV 1991 ; Conference date: 01-03-1991 Through 02-03-1991",

year = "1991",

doi = "10.1109/GLSV.1991.143959",

language = "English",

series = "Proceedings - 1st Great Lakes Symposium on VLSI, GLSV 1991",

pages = "157--162",

booktitle = "Proceedings - 1st Great Lakes Symposium on VLSI, GLSV 1991",

}

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 - https://www.scopus.com/pages/publications/85040731298

UR - https://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

T2 - 1st Great Lakes Symposium on VLSI, GLSV 1991

Y2 - 1 March 1991 through 2 March 1991

ER -

Routing non-convex grids without holes

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this