Minimum Size Tree-Decompositions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Minimum Size Tree-Decompositions


Tree-Decompositions are the corner-stone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute tree- decompositions with small width. However, practical algorithms computing tree-decompositions only exist for graphs with treewidth less than 4. In such graphs, the time-complexity of dynamic program- ming algorithms based on tree-decompositions is dominated by the size (number of bags) of the tree- decompositions. It is then interesting to try to minimize the size of the tree-decompositions. In this extended abstract, we consider the problem of computing a tree-decomposition of a graph with width at most k and minimum size. More precisely, we focus on the following problem: given a fixed k >= 1, what is the complexity of computing a tree-decomposition of width at most k with minimum size in the class of graphs with treewidth at most k? We prove that the problem is NP-complete for any fixed k >= 4 and polynomial for k <= 2. On going work also suggests it is polynomial for k = 3.
Fichier principal
Vignette du fichier
ICGT_V5.pdf (242.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01023904 , version 1 (15-07-2014)


  • HAL Id : hal-01023904 , version 1


Bi Li, Fatima Zahra Moataz, Nicolas Nisse. Minimum Size Tree-Decompositions. 9th International colloquium on graph theory and combinatorics (ICGT), 2014, Grenoble, France. ⟨hal-01023904⟩
295 View
436 Download


Gmail Facebook Twitter LinkedIn More