Single Row Routing
From MaRDI portal
Publication:3659167
DOI10.1109/TC.1983.1676213zbMath0513.68065OpenAlexW1890767989MaRDI QIDQ3659167
Raghunath Raghavan, Sartaj K. 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
Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items (8)
Algorithms for the fixed linear crossing number problem ⋮ Minimizing channel density in standard cell layout ⋮ Optimum embedding of complete graphs in books ⋮ Approximating the fixed linear crossing number ⋮ The benefits of external wires in single row routing ⋮ An analysis of some linear graph layout heuristics ⋮ A fast algorithm for finding interlocking sets ⋮ Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
This page was built for publication: Single Row Routing
