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 条
  • [31] STRONGER RECONSTRUCTION OF DISTANCE-HEREDITARY GRAPHS
    Priya, P. Devi
    Monikandan, S.
    [J]. TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2021, 11 : 25 - 29
  • [32] Parallel decomposition of distance-hereditary graphs
    Hsieh, SY
    [J]. PARALLEL COMPUTATION, 1999, 1557 : 417 - 426
  • [33] Distance-hereditary graphs and signpost systems
    Nebesky, Ladislav
    [J]. DISCRETE MATHEMATICS, 2010, 310 (03) : 527 - 530
  • [34] Dynamic programming on distance-hereditary graphs
    Chang, MS
    Hsieh, SY
    Chen, GH
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 344 - 353
  • [35] Centers and medians of distance-hereditary graphs
    Yeh, HG
    Chang, GJ
    [J]. DISCRETE MATHEMATICS, 2003, 265 (1-3) : 297 - 310
  • [36] Recognition of probe distance-hereditary graphs
    Chang, Maw-Shang
    Hung, Ling-Ju
    Rossmanith, Peter
    [J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (03) : 336 - 348
  • [37] The Hamiltonian problem on distance-hereditary graphs
    Hsieh, SY
    Ho, CW
    Hsu, TS
    Ko, MT
    [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (03) : 508 - 524
  • [38] Eccentricity function in distance-hereditary graphs
    Dragan, Feodor F.
    Guarnera, Heather M.
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 833 : 26 - 40
  • [39] Distance-hereditary embeddings of circulant graphs
    Martínez, C
    Beivide, R
    Gutierrez, J
    Izu, C
    [J]. ITCC 2003: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2003, : 320 - 324
  • [40] Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
    Kiyomi, Masashi
    Saitoh, Toshiki
    Uehara, Ryuhei
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 426 - 432
12345