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 条

[41] On linear recognition of tree-width at most four
Sanders, DP
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1996, 9 (01) : 101 - 117
[42] PARAMETRIC PROBLEMS ON GRAPHS OF BOUNDED TREE-WIDTH
FERNANDEZBACA, D
SLUTZKI, G
JOURNAL OF ALGORITHMS, 1994, 16 (03) : 408 - 430
[43] Efficient parallel algorithms for graphs of bounded tree-width
Lagergren, J.
Journal of Algorithms, 1996, 20 (01): : 20 - 44
[44] Ka,k minors in graphs of bounded tree-width
Böhme, T
Maharry, J
Mohar, B
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 86 (01) : 133 - 147
[45] Local Tree-Width, Excluded Minors, and Approximation Algorithms
Martin Grohe
Combinatorica, 2003, 23 : 613 - 632
[46] Two feedback problems for graphs with bounded tree-width
Zhang S.
Li G.
Sohn M.-Y.
Applied Mathematics-A Journal of Chinese Universities, 2004, 19 (2) : 149 - 154
[47] Collective tree spanners in graphs with bounded genus, chordality, tree-width, or clique-width
Dragan, FF
Yan, CY
ALGORITHMS AND COMPUTATION, 2005, 3827 : 583 - 592
[48] A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
Fuerer, Martin
LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 72 - 83
[49] DYNAMIC-PROGRAMMING ON GRAPHS WITH BOUNDED TREE-WIDTH
BODLAENDER, HL
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 317 : 105 - 118
[50] Exploiting Decomposition on Constraint Problems with High Tree-Width
Kitching, Matthew
Bacchus, Fahiem
21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 525 - 531

← 1 2 3 4 5 →