Exact algorithms for treewidth and minimum fill-in (2004)
Cached
Download Links
- [www.ii.uib.no]
- [lita.sciences.univ-metz.fr]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004). Lecture Notes in Comput. Sci |
| Citations: | 23 - 13 self |
BibTeX
@INPROCEEDINGS{Fomin04exactalgorithms,
author = {Fedor V. Fomin and Ioan Todinca and Dieter Kratsch and Yngve Villanger},
title = {Exact algorithms for treewidth and minimum fill-in},
booktitle = {In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004). Lecture Notes in Comput. Sci},
year = {2004},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show that the treewidth and the minimum fill-in of an n-vertex graph can be computed in time O(1.8899 n). Our results are based on combinatorial proofs that an n-vertex graph has O(1.7087 n) minimal separators and O(1.8135 n) potential maximal cliques. We also show that for the class of AT-free graphs the running time of our algorithms can be reduced to O(1.4142 n).
