@article{47ba5560a33443eb8f0d03b402d152de,
title = "Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs",
abstract = "A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. This paper presents efficient algorithms for solving the weighted connected k-domination and the weighted k-dominating clique problems in distance-hereditary graphs.",
keywords = "Algorithm, Connected k-domination, Distance-hereditary graph, k-dominating clique",
author = "Yeh, {Hong Gwa} and Chang, {Gerard J.}",
note = "Funding Information: Supported in part by the National Science Council under grant NSC87-2115-M009-007. ∗Corresponding author. Tel.: +886-3-573-1945; fax: +886-3-542-2682.",
year = "2001",
doi = "10.1016/S0304-3975(00)00225-5",
language = "???core.languages.en_GB???",
volume = "263",
pages = "3--8",
journal = "Theoretical Computer Science",
issn = "0304-3975",
number = "1-2",
}