Abstract
We give an algorithm that for an input n-vertex graph G and integer κ > 0, in time 2O(κ)n, either outputs that the treewidth of G is larger than κ, or gives a tree decomposition of G of width at most 5κ + 4. This is the first algorithm providing
... read more