Topological bandwidth
- 1 January 1983
- book chapter
- Published by Springer Nature
- p. 317-331
- https://doi.org/10.1007/3-540-12727-5_19
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Polynomial time algorithms for the MIN CUT problem on degree restricted treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- The complexity of searching a graphPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Bandwidth constrained NP-Complete problemsPublished by Association for Computing Machinery (ACM) ,1981
- 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