Routing non-convex grids without holes

D. Parks, M. Truszczynski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings - 1st Great Lakes Symposium on VLSI, GLSV 1991
Pages157-162
Number of pages6
ISBN (Electronic)0818621702, 9780818621703
DOIs
StatePublished - 1991
Event1st Great Lakes Symposium on VLSI, GLSV 1991 - Kalamazoo, United States
Duration: Mar 1 1991Mar 2 1991

Publication series

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

Conference

Conference1st Great Lakes Symposium on VLSI, GLSV 1991
Country/TerritoryUnited States
CityKalamazoo
Period3/1/913/2/91

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Routing non-convex grids without holes'. Together they form a unique fingerprint.

Cite this