A general strategy on the bandwidth minimization (BM) problem

DOI10.1080/00207168408803418zbMath0542.65022OpenAlexW2034878345MaRDI QIDQ3330391

Shaowen Mai, David J. Evans

Publication date: 1984

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168408803418

zbMATH Keywords

shiftingbandwidth minimizationlevel structurerenumberingscanning

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Cites Work

• The NP-completeness of the bandwidth minimization problem
• Note on minimizing the bandwidth of sparse, symmetric matrices
• The bandwidth problem for graphs and matrices—a survey
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Complexity Results for Bandwidth Minimization

This page was built for publication: A general strategy on the bandwidth minimization (BM) problem