Publication: Computing the Minimum Fill-in is NP-complete
Introduction
Applications
Tools
Research Groups
Workshops
Publications
   List Publications
   Advanced Search
   Info
   Add Publications
My Account
About

Computing the Minimum Fill-in is NP-complete

- Article in a journal -
 

Author(s)
Mihalis Yannakakis

Published in
SIAM Journal on Discrete Mathematics

Year
1981

AD Theory and Techniques
Sparsity

BibTeX
@ARTICLE{
         Yannakakis1981CtM,
       ad_theotech = "Sparsity",
       author = "Mihalis Yannakakis",
       title = "{C}omputing the Minimum Fill-in is {NP}-complete",
       journal = "{SIAM} Journal on Discrete Mathematics",
       volume = "2",
       year = "1981",
       pages = "77--79",
       number = "1"
}


back
  

Contact:
autodiff.org
Username:
Password:
(lost password)