1 code implementation • 7 Nov 2012 • Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time for graphs G=(V, E) with a given tree decomposition of width tw.
Data Structures and Algorithms Computational Complexity Discrete Mathematics F.2.2; G.2.8
