Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In
Résumé
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.