Minimum size tree-decompositions

被引：2

作者：

Li, Bi ^{[3
]}

Moataz, Fatima Zahra ^{[1
,2
]}

Nisse, Nicolas ^{[1
,2
]}

Suchan, Karol ^{[4
,5
]}

机构：

[1] INRIA, Rennes, France

[2] Univ Nice Sophia Antipolis, CNRS, UMR 7271, I3S, Sophia Antipolis, France

[3] Xidian Univ, Sch Math & Stat, Xian, Shaanxi, Peoples R China

[4] Univ Adolfo Ibanez, Santiago, Chile

[5] AGH Univ Sci & Technol, Krakow, Poland

来源：

DISCRETE APPLIED MATHEMATICS | 2018年 / 245卷

关键词：

Tree-decomposition; Treewidth; NP-hard; PARTIAL; 3-TREES; RECOGNITION; COMPLEXITY; TREEWIDTH; GRAPHS; WIDTH;

D O I：

10.1016/j.dam.2017.01.030

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：109 / 127

页数：19

共 50 条

[21] Constructing Tree-Decompositions That Display All Topological Ends
Pitz, Max
COMBINATORICA, 2022, 42 (05) : 763 - 769
[22] Query evaluation via tree-decompositions - Extended abstract
Flum, J
Frick, M
Grohe, M
DATABASE THEORY - ICDT 2001, PROCEEDINGS, 2001, 1973 : 22 - 38
[23] Constructing Tree-Decompositions That Display All Topological Ends
Max Pitz
Combinatorica, 2022, 42 : 763 - 769
[24] Burling graphs, chromatic number, and orthogonal tree-decompositions
Felsner, Stefan
Joret, Gwenael
Micek, Piotr
Trotter, William T.
Wiechert, Veit
ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (01):
[25] Adaptive and Opportunistic Exploitation of Tree-decompositions for Weighted CSPs
Jegou, Philippe
Kanso, Helene
Terrioux, Cyril
2017 IEEE 29TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2017), 2017, : 366 - 373
[26] Computing and exploiting tree-decompositions for solving constraint networks
Jégou, P
Ndiaye, SN
Terrioux, C
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2005, PROCEEDINGS, 2005, 3709 : 777 - 781
[27] From tree-decompositions to clique-width terms
Courcelle, Bruno
DISCRETE APPLIED MATHEMATICS, 2018, 248 : 125 - 144
[28] SIMPLICIAL TREE-DECOMPOSITIONS OF INFINITE-GRAPHS .1.
DIESTEL, R
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1990, 48 (02) : 197 - 215
[29] All Graphs Have Tree-Decompositions Displaying Their Topological Ends
Carmesin, Johannes
COMBINATORICA, 2019, 39 (03) : 545 - 596
[30] Refining Tree-Decompositions so That They Display the k-Blocks
Albrechtsen, Sandra
JOURNAL OF GRAPH THEORY, 2025,

← 1 2 3 4 5 →