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

page 1

page 3

page 7

page 13

page 17

research
02/09/2023

A new width parameter of graphs based on edge cuts: α-edge-crossing width

We introduce graph width parameters, called α-edge-crossing width and ed...
research
08/21/2023

Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability

In the Minimum Bisection problem, input is a graph G and the goal is to ...
research
08/18/2021

Witnessing subsystems for probabilistic systems with low tree width

A standard way of justifying that a certain probabilistic property holds...
research
04/05/2021

Spined categories: generalizing tree-width beyond graphs

We develop a general theory of categories that admit a functorial invari...
research
01/10/2013

Maximum Likelihood Bounded Tree-Width Markov Networks

Chow and Liu (1968) studied the problem of learning a maximumlikelihood ...
research
05/07/2023

Reconsideration of Tangle and Ultrafilter using Separation and Partition

Tangle is a concept in graph theory that has a dual relationship with br...
research
07/02/2022

Sum-of-Max Partition under a Knapsack Constraint

Sequence partition problems arise in many fields, such as sequential dat...

Please sign up or login with your details

Forgot password? Click here to reset