# Minimum Size Tree-Decompositions

2 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We study in this paper the problem of computing a tree-decomposition of a graph with width at most k and minimum number of bags. 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 number of bags 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.
Document type :
Journal articles

Cited literature [13 references]

https://hal.inria.fr/hal-01620389
Contributor : Nicolas Nisse <>
Submitted on : Thursday, November 23, 2017 - 3:26:18 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM

### File

MSTD-DAM-v3.pdf
Files produced by the author(s)

### Citation

Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan. Minimum Size Tree-Decompositions. Discrete Applied Mathematics, Elsevier, 2017, ⟨10.1016/j.dam.2017.01.030⟩. ⟨hal-01620389⟩

Record views