DMCA
Exact (exponential) algorithms for treewidth and minimum fill-in (2004)
Cached
Download Links
- [lita.sciences.univ-metz.fr]
- [www.ii.uib.no]
- [www.ii.uib.no]
- [www.ii.uib.no]
- DBLP
Other Repositories/Bibliography
by
Fedor V. Fomin
,
Dieter Kratsch
,
Ioan Todinca
| Venue: | In Proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP 2004 |
| Citations: | 23 - 5 self |
BibTeX
@INPROCEEDINGS{Fomin04exact(exponential),
author = {Fedor V. Fomin and Dieter Kratsch and Ioan Todinca},
title = {Exact (exponential) algorithms for treewidth and minimum fill-in},
booktitle = {In Proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP 2004},
year = {2004},
pages = {568--580},
publisher = {Springer LNCS}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
minimum fill-in
