Weighted connected domination and Steiner trees in distance-hereditary graphs

被引：17
|
作者：
Yeh, HG [1 ]
Chang, GJ [1 ]
机构：
[1] Natl Chiao Tung Univ, Dept Appl Math, Hsinchu 30050, Taiwan
来源：
DISCRETE APPLIED MATHEMATICS | 1998年 / 87卷 / 1-3期
关键词：
distance-hereditary graph; connected domination; Steiner tree; algorithm; cograph;
D O I：
10.1016/S0166-218X(98)00060-2
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Distance-hereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. This paper studies distance-hereditary graphs from an algorithmic viewpoint. In particular, we present linear-time algorithms for finding a minimum weighted connected dominating set and a minimum vertex-weighted Steiner tree in a distance-hereditary graph. Both problems are NP-complete in general graphs. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：245 / 253
页数：9
相关论文
共 50 条
  • [41] The Weisfeiler–Leman Dimension of Distance-Hereditary Graphs
    Alexander L. Gavrilyuk
    Roman Nedela
    Ilia Ponomarenko
    [J]. Graphs and Combinatorics, 2023, 39
  • [42] Distance-hereditary graphs are clique-perfect
    Lee, CM
    Chang, MS
    [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (03) : 525 - 536
  • [43] STEINER SET AND CONNECTED DOMINATION IN TRAPEZOID GRAPHS
    LIANG, YD
    [J]. INFORMATION PROCESSING LETTERS, 1995, 56 (02) : 101 - 108
  • [44] Hamilton cycles in almost distance-hereditary graphs
    Chen, Bing
    Ning, Bo
    [J]. OPEN MATHEMATICS, 2016, 14 : 19 - 28
  • [45] On the geodetic iteration number of distance-hereditary graphs
    Dourado, Mitre C.
    Oliveira, Rodolfo A.
    Protti, Fabio
    Rautenbach, Dieter
    [J]. DISCRETE MATHEMATICS, 2016, 339 (02) : 489 - 498
  • [46] Hamiltonian cycle problem on distance-hereditary graphs
    Hung, RW
    Wu, SC
    Chang, MS
    [J]. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2003, 19 (05) : 827 - 838
  • [47] Which distance-hereditary graphs are cover-incomparability graphs?
    Maxova, Jana
    Turzik, Daniel
    [J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2095 - 2100
  • [48] Characterization of efficiently solvable problems on distance-hereditary graphs
    Hsieh, SY
    Ho, CW
    Hsu, TS
    Ko, MT
    Chen, GH
    [J]. ALGORITHMS AND COMPUTATIONS, 1998, 1533 : 257 - 266
  • [49] Linear Rank-Width of Distance-Hereditary Graphs
    Adler, Isolde
    Kante, Mamadou Moustapha
    Kwon, O-joung
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2014, 8747 : 42 - 55
  • [50] On distance connected domination numbers of graphs
    Tian, Fang
    Xu, Jun-Ming
    [J]. ARS COMBINATORIA, 2007, 84 : 357 - 367
12345