Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- 1 June 1976
- journal article
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 54 (3) , 622-633
- https://doi.org/10.1016/0022-247x(76)90182-7
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On Optimal-Pivoting Algorithms in Sparse MatricesIEEE Transactions on Circuit Theory, 1972
- An Optimal Ordering of Electronic Circuit Equations for a Sparse Matrix SolutionIEEE Transactions on Circuit Theory, 1971
- 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
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962
- The Use of Linear Graphs in Gauss EliminationSIAM Review, 1961