On the parameterized complexity of computing tree-partitions

Hans L. Bodlaender, Carla Groenland, Hugo Jacob

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 obta…