Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- 31 December 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (4), 531-546
- https://doi.org/10.1016/0196-6774(84)90006-3
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on TreesSIAM Journal on Algebraic Discrete Methods, 1982
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial TimeSIAM Journal on Algebraic Discrete Methods, 1980
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- The NP-Completeness of the bandwidth minimization problemComputing, 1976
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Large Scale Integration of MOS Complex Logic: A Layout MethodIEEE Journal of Solid-State Circuits, 1967