DYNAMIC-PROGRAMMING ON GRAPHS WITH BOUNDED TREE-WIDTH

被引：0
|
作者：
BODLAENDER, HL [1 ]
机构：
[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 317卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：105 / 118
页数：14
相关论文
共 50 条
  • [1] Chordal graphs with bounded tree-width
    Castellvi, Jordi
    Drmota, Michael
    Noy, Marc
    Requile, Clement
    ADVANCES IN APPLIED MATHEMATICS, 2024, 157
  • [2] Partitioning graphs of bounded tree-width
    Ding, GL
    Oporowski, B
    Sanders, DP
    Vertigan, D
    COMBINATORICA, 1998, 18 (01) : 1 - 12
  • [3] Layout of graphs with bounded tree-width
    Dujmovic, V
    Morin, P
    Wood, DR
    SIAM JOURNAL ON COMPUTING, 2005, 34 (03) : 553 - 579
  • [4] Partitioning Graphs of Bounded Tree-Width
    Guoli Ding
    Bogdan Oporowski
    Daniel P. Sanders
    Dirk Vertigan
    Combinatorica, 1998, 18 : 1 - 12
  • [5] Nonrepetitive colorings of graphs of bounded tree-width
    Kuendgen, Andre
    Pelsmajer, Michael J.
    DISCRETE MATHEMATICS, 2008, 308 (19) : 4473 - 4478
  • [6] Tree-width and optimization in bounded degree graphs
    Lozin, Vadim
    Milanic, Martin
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 45 - +
  • [7] PARAMETRIC PROBLEMS ON GRAPHS OF BOUNDED TREE-WIDTH
    FERNANDEZBACA, D
    SLUTZKI, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 621 : 304 - 316
  • [8] PARAMETRIC PROBLEMS ON GRAPHS OF BOUNDED TREE-WIDTH
    FERNANDEZBACA, D
    SLUTZKI, G
    JOURNAL OF ALGORITHMS, 1994, 16 (03) : 408 - 430
  • [9] Deciding clique-width for graphs of bounded tree-width
    Espelage, W
    Gurski, F
    Wanke, E
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 87 - 98
  • [10] Multicuts in unweighted graphs with bounded degree and bounded tree-width
    Calinescu, G
    Fernandes, CG
    Reed, B
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 137 - 152
12345