A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
- 1 March 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (1) , 133-145
- https://doi.org/10.1137/0205012
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrixJournal of Mathematical Analysis and Applications, 1976
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Sparsity-Directed Decomposition for Gaussian Elimination on MatricesIEEE Transactions on Power Apparatus and Systems, 1970
- The Use of Linear Graphs in Gauss EliminationSIAM Review, 1961