A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs
- 1 February 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 2 (1) , 100-107
- https://doi.org/10.1137/0402011
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984
- Parallel pivoting algorithms for sparse symmetric matricesParallel Computing, 1984
- A Data Structure for Parallel L/U DecompositionIEEE Transactions on Computers, 1982
- Optimal parallel triangulation of a sparse matrixIEEE Transactions on Circuits and Systems, 1979
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972