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 条
  • [21] Eccentricity function in distance-hereditary graphs
    Dragan, Feodor F.
    Guarnera, Heather M.
    THEORETICAL COMPUTER SCIENCE, 2020, 833 : 26 - 40
  • [22] Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
    Kiyomi, Masashi
    Saitoh, Toshiki
    Uehara, Ryuhei
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 426 - 432
  • [23] The Weisfeiler–Leman Dimension of Distance-Hereditary Graphs
    Alexander L. Gavrilyuk
    Roman Nedela
    Ilia Ponomarenko
    Graphs and Combinatorics, 2023, 39
  • [24] Distance-hereditary graphs are clique-perfect
    Lee, CM
    Chang, MS
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (03) : 525 - 536
  • [25] On the geodetic iteration number of distance-hereditary graphs
    Dourado, Mitre C.
    Oliveira, Rodolfo A.
    Protti, Fabio
    Rautenbach, Dieter
    DISCRETE MATHEMATICS, 2016, 339 (02) : 489 - 498
  • [26] Hamilton cycles in almost distance-hereditary graphs
    Chen, Bing
    Ning, Bo
    OPEN MATHEMATICS, 2016, 14 : 19 - 28
  • [27] Hamiltonian cycle problem on distance-hereditary graphs
    Hung, RW
    Wu, SC
    Chang, MS
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2003, 19 (05) : 827 - 838
  • [28] Maximal connected cographs in distance-hereditary graphs
    McKee, TA
    UTILITAS MATHEMATICA, 2000, 57 : 73 - 80
  • [29] Which distance-hereditary graphs are cover-incomparability graphs?
    Maxova, Jana
    Turzik, Daniel
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2095 - 2100
  • [30] An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs
    Tedder, Marc
    Corneil, Derek
    STACS 2007, PROCEEDINGS, 2007, 4393 : 344 - +
12345