A general strategy on the bandwidth minimization (BM) problem
Shao-Wen Mai, David John Evans · International Journal of Computer Mathematics · 1984
A strategy of shifting by multiple scanning which can lead to near optimum results for the bandwidth minimization (BM) problem for sparse symmetric matrices is presented. An algorithm is described, and the comparisons of results and timings with other algorithms is given. The optimum results are estimated and further refinements of the algorithms are recommended.