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 条
  • [21] Learning Markov networks: Maximum bounded tree-width graphs
    Karger, D
    Srebro, N
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 392 - 401
  • [22] H-Free Coloring on Graphs with Bounded Tree-Width
    Aravind, N. R.
    Kalyanasundaram, Subrahmanyam
    Kare, Anjeneya Swami
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2019, 2019, 11394 : 231 - 244
  • [23] BOUNDED TREE-WIDTH AND LOGCFL
    WANKE, E
    JOURNAL OF ALGORITHMS, 1994, 16 (03) : 470 - 491
  • [24] On the complexity of the multicut problem in bounded tree-width graphs and digraphs
    Bentz, Cedric
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (10) : 1908 - 1917
  • [25] On the k-rainbow domination in graphs with bounded tree-width
    Meybodi, M. Alambardar
    Hooshmandasl, M. R.
    Sharifani, P.
    Shakiba, Ali
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2021, 9 (02) : 277 - 300
  • [26] Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width
    Noble, S. D.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2009, 16 (01):
  • [27] Transversals of Longest Cycles in Chordal and Bounded Tree-Width Graphs
    Gutierrez, Juan
    LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 558 - 571
  • [28] The NLC-width and clique-width for powers of graphs of bounded tree-width
    Gurski, Frank
    Wanke, Egon
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (04) : 583 - 595
  • [29] 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
  • [30] Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
    Bordewich, Magnus
    Kang, Ross J.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (04):
12345