Skip to Main content Skip to Navigation
New interface
Conference papers

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In

Abstract : We show that for a graph $G$ on $n$ vertices its treewidth can be computed in $\mathcal{O}(poly(n) 1.9601^n)$ time. Our result is based on combinatorial upper bounds for the number of minimal separators and the number of potential maximal cliques of a graph.
Document type :
Conference papers
Complete list of metadata
Contributor : Ioan Todinca Connect in order to contact the contributor
Submitted on : Wednesday, July 12, 2006 - 8:41:48 PM
Last modification on : Saturday, June 25, 2022 - 10:10:49 AM


  • HAL Id : hal-00085561, version 1



Dieter Kratsch, Fedor V. Fomin, Ioan Todinca. Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. 2004, pp.568-580. ⟨hal-00085561⟩



Record views