Compressed Graphs and the Minimum Degree Algorithm

DOI10.1137/0916081MaRDI QIDQ4859542zbMATH OpenOpenAlexFDO

Authors Cleve Ashcraft

Publication date 21 May 1996

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0916081

zbMATH Keywords

compressed graphminimum degree algorithmordering algorithmsparse symmetric positive definite matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• The Evolution of the Minimum Degree Ordering Algorithm
• Modification of the minimum-degree algorithm by multiple elimination
• An Approximate Minimum Degree Ordering Algorithm
• A column approximate minimum degree ordering algorithm
• A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows

Cited in

(13)

• Using domain decomposition to find graph bisectors
• Two improved algorithms for envelope and wavefront reduction
• A supernodal block factorized sparse approximate inverse for non-symmetric linear systems
• Preconditioning techniques for large linear systems: A survey
• Compressing Bounded Degree Graphs
• A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
• Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
• A block compression algorithm for computing preconditioners
• Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
• A survey of direct methods for sparse linear systems
• Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics
• Compressed Weighted de Bruijn Graphs
• Sparse linear least-squares problems

Describes a project that uses

Uses Software

• Harwell-Boeing sparse matrix collection

This page was built for publication: Compressed Graphs and the Minimum Degree Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859542)