Skip to Main content Skip to Navigation
Conference papers

Minimum Size Tree-decompositions

Abstract : Tree-decompositions are the cornerstone 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 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 extended abstract, we consider the problem of computing a tree-decomposition of a graph with width at most k and minimum size. 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 [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01162695
Contributor : Fatima Zahra Moataz <>
Submitted on : Thursday, June 11, 2015 - 11:08:07 AM
Last modification on : Monday, October 12, 2020 - 10:30:39 AM
Long-term archiving on: : Tuesday, April 25, 2017 - 6:39:09 AM

File

MSTD.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01162695, version 1

Collections

Citation

Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan. Minimum Size Tree-decompositions. LAGOS 2015 – VIII Latin-American Algorithms, Graphs and Optimization Symposium, May 2015, Beberibe, Ceará, Brazil. ⟨hal-01162695⟩

Share

Metrics

Record views

465

Files downloads

290