Abstract

It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in time 2<sup>O(tw)</sup>|<sup>V|O(1)</sup> for graphs G=(V,E) with a given tree decomposition of width tw. However, for nonlocal problems, like the fundamental class of connectivity problems, for a long time we did not
... read more