Computing the Minimum Fill-In is NP-Complete
- 1 March 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 2 (1), 77-79
- https://doi.org/10.1137/0602010
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Node-Deletion Problems on Bipartite GraphsSIAM Journal on Computing, 1981
- Algorithmic Aspects of Vertex Elimination on Directed GraphsSIAM Journal on Applied Mathematics, 1978
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONSPublished by Elsevier BV ,1972