Directed tree-width

被引：162

作者：

Johnson, T ^{[1
]}

Robertson, N

Seymour, PD

Thomas, R

机构：

[1] Princeton Univ, Dept Math, Princeton, NJ 08544 USA

[2] Ohio State Univ, Dept Math, Columbus, OH 43210 USA

[3] Georgia Inst Technol, Sch Math, Atlanta, GA 30332 USA

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 2001年 / 82卷 / 01期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1006/jctb.2000.2031

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We generalize thr concept of tree-width to directed graphs and prove that every directed graph with no "haven" of large order has small tree-width. Conversely, a digraph with a large haven has large tree-width. We also show that the Hamilton cycle problem and other NP-hard problems can be solved in polynomial time when restricted to digraphs of bounded tree-width. (C) 2001 Academic Press.

引用

页码：138 / 154

页数：17

共 50 条

[31] Tree-width and the monadic quantifier hierarchy
Makowsky, JA
Mariño, JP
THEORETICAL COMPUTER SCIENCE, 2003, 303 (01) : 157 - 170
[32] Partitioning Graphs of Bounded Tree-Width
Guoli Ding
Bogdan Oporowski
Daniel P. Sanders
Dirk Vertigan
Combinatorica, 1998, 18 : 1 - 12
[33] Deciding clique-width for graphs of bounded tree-width
Espelage, W
Gurski, F
Wanke, E
ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 87 - 98
[34] Tree-width, clique-minors, and eigenvalues
Hong, Y
DISCRETE MATHEMATICS, 2004, 274 (1-3) : 281 - 287
[35] Parity Games on Graphs with Medium Tree-Width
Fearnley, John
Lachish, Oded
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 303 - 314
[36] Nonrepetitive colorings of graphs of bounded tree-width
Kuendgen, Andre
Pelsmajer, Michael J.
DISCRETE MATHEMATICS, 2008, 308 (19) : 4473 - 4478
[37] Limits of Chordal Graphs With Bounded Tree-Width
Castellvi, Jordi
Stufler, Benedikt
RANDOM STRUCTURES & ALGORITHMS, 2025, 66 (01)
[38] On the tree-depth and tree-width in heterogeneous random graphs
Shang, Yilun
PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES, 2022, 98 (09) : 78 - 83
[39] PARAMETRIC PROBLEMS ON GRAPHS OF BOUNDED TREE-WIDTH
FERNANDEZBACA, D
SLUTZKI, G
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 621 : 304 - 316
[40] Tree-width and optimization in bounded degree graphs
Lozin, Vadim
Milanic, Martin
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 45 - +

← 1 2 3 4 5 →