Single Row Routing

DOI10.1109/TC.1983.1676213MaRDI QIDQ3659167zbMATH OpenOpenAlexFDO

Authors Raghunath Raghavan, Sartaj Sahni

Publication date 1983

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1983.1676213

zbMATH Keywords

single row routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited in

(9)

• Minimizing channel density in standard cell layout
• The benefits of external wires in single row routing
• A fast algorithm for finding interlocking sets
• Optimum embedding of complete graphs in books
• Algorithms for the fixed linear crossing number problem
• Approximating the fixed linear crossing number
• An analysis of some linear graph layout heuristics
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Using Euler’s Formula to Find the Lower Bound of the Page Number

This page was built for publication: Single Row Routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3659167)