Weighted connected domination and Steiner trees in distance-hereditary graphs
| dc.citation.epage | 253 | en_US |
| dc.citation.issue | 1-3 | en_US |
| dc.citation.spage | 245 | en_US |
| dc.citation.volume | 87 | en_US |
| dc.citation.woscount | 10 | |
| dc.contributor.author | Yeh, HG | en_US |
| dc.contributor.author | Chang, GJ | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:47:27Z | |
| dc.date.available | 2014-12-08T15:47:27Z | |
| dc.date.issued | 1998-10-05 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.issn | 0166-218X | en_US |
| dc.identifier.journal | DISCRETE APPLIED MATHEMATICS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/31818 | |
| dc.identifier.wosnumber | WOS:000076462200018 | |
| dc.language.iso | en_US | en_US |
| dc.subject | distance-hereditary graph | en_US |
| dc.subject | connected domination | en_US |
| dc.subject | Steiner tree | en_US |
| dc.subject | algorithm | en_US |
| dc.subject | cograph | en_US |
| dc.title | Weighted connected domination and Steiner trees in distance-hereditary graphs | en_US |
| dc.type | Article | en_US |