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
基金
美国国家科学基金会;
关键词
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 条
  • [21] TREE-WIDTH, PATH-WIDTH, AND CUTWIDTH
    KORACH, E
    SOLEL, N
    DISCRETE APPLIED MATHEMATICS, 1993, 43 (01) : 97 - 101
  • [22] Width parameters beyond tree-width and their applications
    Hlineny, Petr
    Oum, Sang-Il
    Seese, Detlef
    Gottlob, Georg
    COMPUTER JOURNAL, 2008, 51 (03): : 326 - 362
  • [23] Path-width and tree-width of the join of graphs
    Yuan, JJ
    ARS COMBINATORIA, 1996, 43 : 257 - 262
  • [24] Chordal graphs with bounded tree-width
    Castellvi, Jordi
    Drmota, Michael
    Noy, Marc
    Requile, Clement
    ADVANCES IN APPLIED MATHEMATICS, 2024, 157
  • [25] Partitioning graphs of bounded tree-width
    Ding, GL
    Oporowski, B
    Sanders, DP
    Vertigan, D
    COMBINATORICA, 1998, 18 (01) : 1 - 12
  • [26] Multiplicities of eigenvalues and tree-width of graphs
    de Verdiere, YC
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 74 (02) : 121 - 146
  • [27] TREE-WIDTH FOR FIRST ORDER FORMULAE
    Adler, Isolde
    Weyer, Mark
    LOGICAL METHODS IN COMPUTER SCIENCE, 2012, 8 (01)
  • [28] Tree-width of hypergraphs and surface duality
    Mazoit, Frederic
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (03) : 671 - 687
  • [29] Tree-Width for First Order Formulae
    Adler, Isolde
    Weyer, Mark
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2009, 5771 : 71 - +
  • [30] Layout of graphs with bounded tree-width
    Dujmovic, V
    Morin, P
    Wood, DR
    SIAM JOURNAL ON COMPUTING, 2005, 34 (03) : 553 - 579