Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. Fomin, F. V., Kratsch, D., & Todinca, I. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP), pages 568-580, 2004.
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In [link]Paper  bibtex   
@inproceedings{ dblp3986305,
  title = {Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In},
  author = {Fedor V. Fomin and Dieter Kratsch and Ioan Todinca},
  author_short = {Fomin, F. V. and Kratsch, D. and Todinca, I.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2004},
  key = {dblp3986305},
  id = {dblp3986305},
  biburl = {http://www.dblp.org/rec/bibtex/conf/icalp/FominKT04},
  url = {http://dx.doi.org/10.1007/978-3-540-27836-8_49},
  conference = {ICALP},
  pages = {568-580},
  text = {ICALP 2004:568-580},
  booktitle = {Proceedings of International Colloquium on Automata, Languages and Programming (ICALP)}
}

Downloads: 0