NP-completeness for minimizing maximum edge length in grid embeddings
- 31 March 1985
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 6 (1) , 10-16
- https://doi.org/10.1016/0196-6774(85)90016-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- Graphs That are Almost Binary TreesSIAM Journal on Computing, 1982
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2SIAM Journal on Algebraic Discrete Methods, 1981
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial TimeSIAM Journal on Algebraic Discrete Methods, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Bounds on the costs of data encodingsTheory of Computing Systems, 1978
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- The NP-Completeness of the bandwidth minimization problemComputing, 1976