Dynamic programming on distance-hereditary graphs

被引：0
|
作者：
Chang, MS [1 ]
Hsieh, SY
Chen, GH
机构：
[1] Natl Chung Cheng Univ, Dept Comp Sci & Informat Engn, Chiayi 621, Taiwan
[2] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10764, Taiwan
来源：
ALGORITHMS AND COMPUTATION, PROCEEDINGS | 1997年 / 1350卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we define a one-vertex-extension tree for a distance-hereditary graph and show how to build it. We then give a unified approach to designing efficient dynamic programming algorithms for distance-hereditary graphs based upon the one-vertex-extension tree. We give linear time algorithms for the weighted vertex cover and weighted independent domination problems and give an O(n(2)) time algorithm to compute a minimum fill-in and the treewidth for a distance-hereditary graph.
引用
收藏
页码：344 / 353
页数：10
相关论文
共 50 条
  • [41] Graph classes between parity and distance-hereditary graphs
    Cicerone, S
    Di Stefano, G
    DISCRETE APPLIED MATHEMATICS, 1999, 95 (1-3) : 197 - 216
  • [42] A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
    Gassner, Elisabeth
    Hatzl, Johannes
    COMPUTING, 2008, 82 (2-3) : 171 - 187
  • [43] A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
    Shin-ichi Nakano
    Ryuhei Uehara
    Takeaki Uno
    Journal of Computer Science and Technology, 2009, 24 : 517 - 533
  • [44] Weighted connected domination and Steiner trees in distance-hereditary graphs
    Yeh, HG
    Chang, GJ
    DISCRETE APPLIED MATHEMATICS, 1998, 87 (1-3) : 245 - 253
  • [45] The path-partition problem in bipartite distance-hereditary graphs
    Yeh, HG
    Chang, GJ
    TAIWANESE JOURNAL OF MATHEMATICS, 1998, 2 (03): : 353 - 360
  • [46] Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
    Oellermann, Ortrud R.
    Puertas, Maria Luz
    DISCRETE MATHEMATICS, 2007, 307 (01) : 88 - 96
  • [47] A new approach to graph recognition and applications to distance-hereditary graphs
    Nakano, Shin-ichi
    Uehara, Ryuhei
    Uno, Takeaki
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 115 - +
  • [48] Efficient parallel algorithms on distance-hereditary graphs (extended abstract)
    Hsieh, SY
    Ho, CW
    Hsu, TS
    Ko, MT
    Chen, GH
    PROCEEDINGS OF THE 1997 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 1997, : 20 - 23
  • [49] Distance-hereditary digraphs
    Laetsch, Martin
    Schrader, Rainer
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (02) : 231 - 240
  • [50] A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
    Shin-ichi Nakano
    Ryuhei Uehara
    Takeaki Uno
    Journal of Computer Science & Technology, 2009, 24 (03) : 517 - 533
12345