The NP-Completeness of the bandwidth minimization problem
- 1 September 1976
- journal article
- Published by Springer Science and Business Media LLC in Computing
- Vol. 16 (3), 263-270
- https://doi.org/10.1007/bf02280884
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- P-complete problems and approximate solutionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- Some simplified NP-complete problemsPublished by Association for Computing Machinery (ACM) ,1974
- Minimizing the bandwidth of sparse symmetric matricesComputing, 1973
- Note on minimizing the bandwidth of sparse, symmetric matricesComputing, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- Several Strategies for Reducing the Bandwidth of MatricesPublished by Springer Science and Business Media LLC ,1972
- Reducing the bandwidth of sparse symmetric matricesPublished by Association for Computing Machinery (ACM) ,1969