Weighted connected domination and Steiner trees in distance-hereditary graphs
檔案
- 000076462200018.pdf (649.3 KB, Adobe PDF)
日期
1998-10-05
類型
系所
期刊名稱
DISCRETE APPLIED MATHEMATICS
卷期與頁次
第 87 卷第 1-3 期,頁 245–253
ISSN
0166-218X
語言
英文
摘要
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.
所屬典藏
期刊論文引用此條目
Yeh, H., & Chang, G. (1998). Weighted connected domination and Steiner trees in distance-hereditary graphs. DISCRETE APPLIED MATHEMATICS, 87(1-3), 245–253. https://ir.lib.nycu.edu.tw/handle/11536/31818
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31818