user

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 条
  • [1] DISTANCE-HEREDITARY GRAPHS, STEINER TREES, AND CONNECTED DOMINATION
    DATRI, A
    MOSCARINI, M
    [J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (03) : 521 - 538
  • [2] STEINER DISTANCE-HEREDITARY GRAPHS
    DAY, DP
    OELLERMANN, OR
    SWART, HC
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (03) : 437 - 442
  • [3] Domination in distance-hereditary graphs
    Chang, MS
    Wu, SC
    Chang, GJ
    Yeh, HG
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 116 (1-2) : 103 - 113
  • [4] Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
    Yeh, HG
    Chang, GJ
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 263 (1-2) : 3 - 8
  • [5] A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
    Brandstadt, A
    Dragan, FF
    [J]. NETWORKS, 1998, 31 (03) : 177 - 182
  • [6] MAD trees and distance-hereditary graphs
    Datilhaus, E
    Dankelmann, P
    Goddard, W
    Swart, HC
    [J]. DISCRETE APPLIED MATHEMATICS, 2003, 131 (01) : 151 - 167
  • [7] Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
    Oellermann, Ortrud R.
    Puertas, Maria Luz
    [J]. DISCRETE MATHEMATICS, 2007, 307 (01) : 88 - 96
  • [8] PERMUTATION GRAPHS - CONNECTED DOMINATION AND STEINER TREES
    COLBOURN, CJ
    STEWART, LK
    [J]. DISCRETE MATHEMATICS, 1990, 86 (1-3) : 179 - 189
  • [9] Maximal connected cographs in distance-hereditary graphs
    McKee, TA
    [J]. UTILITAS MATHEMATICA, 2000, 57 : 73 - 80
  • [10] Paired-Domination Problem on Distance-Hereditary Graphs
    Ching-Chi Lin
    Keng-Chu Ku
    Chan-Hung Hsu
    [J]. Algorithmica, 2020, 82 : 2809 - 2840
12345