The complexity of minimizing wire lengths in VLSI layouts
- 17 June 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (4), 263-267
- https://doi.org/10.1016/0020-0190(87)90173-6
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- NP-completeness for minimizing maximum edge length in grid embeddingsJournal of Algorithms, 1985
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1984
- Universality considerations in VLSI circuitsIEEE Transactions on Computers, 1981
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial TimeSIAM Journal on Algebraic Discrete Methods, 1980
- Encoding Data Structures in TreesJournal of the ACM, 1979
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- The NP-Completeness of the bandwidth minimization problemComputing, 1976