On the parameterized complexity of computing tree-partitions

06/23/2022
by   Hans L. Bodlaender, et al.
0

We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree. On one hand, we can obtain approximations of the tree-partition-width efficiently: we show that there is an algorithm that, given an n-vertex graph G and an integer k, constructs a tree-partition of width O(k^7) for G or reports that G has tree-partition width more than k, in time k^O(1)n^2. We can improve on the approximation factor or the dependence on n by sacrificing the dependence on k. On the other hand, we show the problem of computing tree-partition-width exactly is XALP-complete, which implies that it is W[t]-hard for all t. We deduce XALP-completeness of the problem of computing the domino treewidth. Finally, we adapt some known results on the parameter tree-partition-width and the topological minor relation, and use them to compare tree-partition-width to tree-cut width.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset