Skip to Main content Skip to Navigation

Size-Constrained Tree Decompositions

Bi Li 1, 2 Fatima Zahra Moataz 1 Nicolas Nisse 1 Karol Suchan 3, 4
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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 programming algorithms based on tree-decompositions is dominated by the size (number of bags) of the tree-decompositions. It is then interesting to minimize the size of the tree-decompositions. In this report, 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; for k = 3, we show that it is polynomial in the class of trees and 2-connected outerplanar graphs.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01074177
Contributor : Fatima Zahra Moataz <>
Submitted on : Monday, October 13, 2014 - 11:27:02 AM
Last modification on : Thursday, March 5, 2020 - 12:20:45 PM
Document(s) archivé(s) le : Thursday, January 15, 2015 - 2:55:31 PM

File

ReportV1.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01074177, version 1

Collections

Citation

Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan. Size-Constrained Tree Decompositions. [Research Report] INRIA Sophia-Antipolis. 2014. ⟨hal-01074177⟩

Share

Metrics

Record views

454

Files downloads

208