Article
Minimum Separation for Single-Layer Channel Routing
Information Processing Letters
Document Type
Article
Publication Date
9-1-1992
Pages
201-205
Publisher Name
Elsevier
Disciplines
Abstract
We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.
Creative Commons License
Creative Commons Attribution-Noncommercial-No Derivative Works 3.0
Copyright Statement
© 1992 Elsevier.
Citation Information
Ronald I. Greenberg and F. Miller Maley. "Minimum Separation for Single-Layer Channel Routing" Information Processing Letters Vol. 43 Iss. 4 (1992) Available at: http://works.bepress.com/ronald-greenberg/35/
Author Posting. © Elsevier, 1992. This is the author's version of the work. It is posted here by permission of Elsevier for personal use, not for redistribution. The definitive version was published in Information Processing Letters, Volume 43, Issue 4, 28 September 1992, Pages 201-205, http://dx.doi.org/10.1016/0020-0190(92)90201-6.
Slides on this material included in the presentation at http://ecommons.luc.edu/cs_facpubs/184