Direct methods for sparse matrices
Direct methods for sparse matrices
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The Profile Minimization Problem in Trees
SIAM Journal on Computing
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Laying Out Sparse Graphs with Provably Minimum Bandwidth
INFORMS Journal on Computing
| Hi-index | 0.00 |
The problem that we address is, given a matrix, permute rows and columns so that the bandwidth is minimized. Several constructive heuristic algorithms have been proposed in the literature to reduce the bandwidth of symmetrically structured matrices. However, these methods are often ineffective when applied to some pathological cases. In the present paper we propose a new heuristic obtained as an improvement of the classical Cuthill McKee algorithm. From the computational results it appears that the new algorithm overcomes the pathological cases where the literature algorithm get stuck. The algorithm is applied to data from real applications. A comparison on real cases is also made with previous constructive approaches demonstrating the superior performance of the here proposed method.