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
关键词
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 条