Compressed Graphs and the Minimum Degree Algorithm
- 1 November 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 16 (6) , 1404-1411
- https://doi.org/10.1137/0916081
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- The Minimum Degree Ordering with ConstraintsSIAM Journal on Scientific and Statistical Computing, 1989
- A graph partitioning algorithm by node separatorsACM Transactions on Mathematical Software, 1989
- The Evolution of the Minimum Degree Ordering AlgorithmSIAM Review, 1989
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985