Answers are grounded in this paper and cite their sources.
An algorithm is described which will reduce the bandwidth of a square matrix with symmetrically disposed coefficients, by permuting the row and columns. A computer program for the algorithm has been used successfully to find the minimum bandwidth of matrices of order 30 or so arising in electrical and hydraulic networks, and for reducing substantially the bandwidth of matrices of order up to 250.
No takes yet. Share an insight, caveat, or question.
G. G. Alway (1965) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: