DeepAI AI Chat
Log In Sign Up

On the parameterized complexity of computing tree-partitions

by   Hans L. Bodlaender, et al.
ENS Paris-Saclay
Utrecht University

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.


page 1

page 3

page 7

page 13

page 17


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

We introduce graph width parameters, called α-edge-crossing width and ed...

Algorithmic Applications of Tree-Cut Width

The recently introduced graph parameter tree-cut width plays a similar r...

Witnessing subsystems for probabilistic systems with low tree width

A standard way of justifying that a certain probabilistic property holds...

Spined categories: generalizing tree-width beyond graphs

We develop a general theory of categories that admit a functorial invari...

Reconsideration of Tangle and Ultrafilter using Separation and Partition

Tangle is a concept in graph theory that has a dual relationship with br...

The Effect of Planarization on Width

We study the effects of planarization (the construction of a planar diag...

Maximum Likelihood Bounded Tree-Width Markov Networks

Chow and Liu (1968) studied the problem of learning a maximumlikelihood ...