Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

PDF

Loyola University Chicago

Series

1992

Algorithms

Articles 1 - 1 of 1

Full-Text Articles in Entire DC Network

Minimum Separation For Single-Layer Channel Routing, Ronald I. Greenberg, F. Miller Maley Sep 1992

Minimum Separation For Single-Layer Channel Routing, Ronald I. Greenberg, F. Miller Maley

Computer Science: Faculty Publications and Other Works

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.