Toward Characterization of Perfect Elimination Digraphs
- 1 December 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 2 (4) , 217-224
- https://doi.org/10.1137/0202018
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Complexity Bounds for Regular Finite Difference and Finite Element GridsSIAM Journal on Numerical Analysis, 1973
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier ,1972
- The Role of Partitioning in the Numerical Solution of Sparse SystemsPublished by Springer Nature ,1972
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970