The bandwidth problem for graphs and matrices—a survey
- 1 September 1982
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 6 (3), 223-254
- https://doi.org/10.1002/jgt.3190060302
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- A Comparison of Several Bandwidth and Profile Reduction AlgorithmsACM Transactions on Mathematical Software, 1976
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- An automatic node relabelling scheme for minimizing a matrix or network bandwidthInternational Journal for Numerical Methods in Engineering, 1976
- Optimal labelling of a product of two pathsDiscrete Mathematics, 1975
- Tridiagonalization by permutationsCommunications of the ACM, 1974
- An automatic node-relabeling scheme for bandwidth minimization of stiffness matrices.AIAA Journal, 1968
- Row-column permutation of sparse matricesThe Computer Journal, 1967
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- An algorithm for reducing the bandwidth of a matrix of symmetrical configurationThe Computer Journal, 1965
- The Analysis of Large Structural SystemsThe Computer Journal, 1960