Complexity Results for Bandwidth Minimization

著者: M. R. Garey, Ronald Graham, David S. Johnson, D. E. Knuth - SIAM Journal on Applied Mathematics 1978 被引用: 296

A linear-time algorithm for sparse symmetric matrices which converts a matrix into pentadiagonal form (bandwidth 2), whenever it is possible to do so using simultaneous row and column permutations is described.