M Yannanakis. Computing the minimum fill-in is NP-complete. SIAM Journal of Algebraic and Discrete Methods, 1981. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Generic Graph Algorithms for Sparse Matrix Ordering - Lee, Siek, Lumsdaine (1999) (2 citations) (Correct)
The High Performance Generic Graph Component Library - Lee (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC