The bandwidth problem for graphs and matrices - a survey

The bandwidth problem for a graph G is to label its n vertices vi with distinct integers f(vi) so that the quantity max{| f(vi) − f(vi)| : (vi vj) ∈ E(G)} is minimized. The corresponding problem for a real symmetric matrix M is to find a symmetric permutation M' of M so that the quantity max{| i − j| : m'ij ≠ 0} is minimized. This survey describes all the results known to the authors as of approximately August 1981. These results include the effect on bandwidth of local operations such as refinement and contraction of graphs, bounds on bandwidth in terms of other graph invariants, the bandwidth of special classes of graphs, and approximate bandwidth algorithms for graphs and matrices. The survey concludes with a brief discussion of some problems related to bandwidth.

[1]  Da-Lun Wang,et al.  Discrete Isoperimetric Problems , 1977 .

[2]  G. C. Everstine,et al.  Recent improvements to BANDIT , 1975 .

[3]  O. Zienkiewicz.  The Finite Element Method In Engineering Science , 1971 .

[4]  Ian P. King,et al.  An automatic reordering scheme for simultaneous equations derived from network systems , 1970 .

[5]  Carl H. FitzGerald.  Optimal indexing of the vertices of graphs , 1974 .

[6]  Gordon C Everstine.  The BANDIT Computer Program for the Reduction of Matrix Bandwidth for NASTRAN , 1972 .

[7]  R. Snay.  Reducing the profile of sparse symmetric matrices , 1976 .

[8]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[9]  R. K. Livesley,et al.  The Analysis of Large Structural Systems , 1960, Comput. J..

[10]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[11]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[12]  Takeo Taniguchi,et al.  Reducing the Bandwidth of Structural Stiffness Matrices , 1976 .

[13]  D. Rose.  A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[14]  Jarmila Chvátalová,et al.  Optimal labelling of a product of two paths , 1975, Discret. Math..

[15]  Norman E. Gibbs,et al.  Tridiagonalization by permutations , 1974, Commun. ACM.

[16]  R. Levy.  Structural Stiffness Matrix Wavefront Resequencing Program (WAVEFRONT) , 1973 .

[17]  G.S. Bloom,et al.  Applications of numbered undirected graphs , 1977, Proceedings of the IEEE.

[18]  F. A. Akyuz,et al.  An automatic node-relabeling scheme for bandwidth minimization of stiffness matrices. , 1968 .

[19]  David A. Sheppard,et al.  The factorial representation of balanced labelled graphs , 1976, Discret. Math..

[20]  Richard Rosen.  Matrix bandwidth minimization , 1968, ACM National Conference.

[21]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[22]  Norman E. Gibbs,et al.  A Comparison of Several Bandwidth and Profile Reduction Algorithms , 1976, TOMS.

[23]  Gordon C. Everstine,et al.  A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront , 1979 .

[24]  G. G. Alway,et al.  An algorithm for reducing the bandwidth of a matrix of symmetrical configuration , 1965, Comput. J..

[25]  Elizabeth Cuthill,et al.  Several Strategies for Reducing the Bandwidth of Matrices , 1972 .

[26]  William F. Smyth,et al.  An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices , 1971, IFIP Congress.

[27]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[28]  James B. Saxe,et al.  Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time , 1980, SIAM J. Algebraic Discret. Methods.

[29]  Fevzican A. Akyuz,et al.  Reply by Author to J. Barlow and C.G. Marples , 1969 .

[30]  L. H. Harper.  Optimal numberings and isoperimetric problems on graphs , 1966 .

[31]  Norman E. Gibbs,et al.  Algorithm 508: Matrix Bandwidth and Profile Reduction [F1] , 1976, TOMS.

[32]  Georges Akhras,et al.  An automatic node relabelling scheme for minimizing a matrix or network bandwidth , 1976 .

[33]  J. Barlow,et al.  Comment on "An Automatic Node-Relabeling Scheme for Bandwidth Minimization of Stiffness Matrices" , 1969 .

[34]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[35]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[36]  Reginald P. Tewarson,et al.  Row-column permutation of sparse matrices , 1967, Comput. J..

[37]  Ronald L. Graham,et al.  ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS , 1970 .

[38]  Joseph Wai-Hung Liu,et al.  On reducing the profile of sparse symmetric matrices. , 1976 .

[39]  Jeff Kahn,et al.  On cross-bandwidth , 1981, Discret. Math..

[40]  V. Chvátal,et al.  A remark on a problem of Harary , 1970 .

[41]  R. Collins.  Bandwidth reduction by automatic renumbering , 1973 .

[42]  J. A. George.  Computer implementation of the finite element method , 1971 .

[43]  David S. Johnson,et al.  COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[44]  A. George,et al.  Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems , 1978 .

[45]  William F. Smyth,et al.  Another algorithm for reducing bandwidth and profile of a sparse matrix , 1899, AFIPS '76.

[46]  William G. Poole,et al.  An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .

[47]  Norman E. Gibbs,et al.  Algorithm 509: A Hybrid Profile Reduction Algorithm [F1] , 1976, TOMS.

[48]  Solomon W. Golomb,et al.  HOW TO NUMBER A GRAPH††This research was supported in part by the United States Air Force under Grant AFOSR-68-1555. , 1972 .