Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs

Authors
Yeh, HG Chang, GJ
Citation
Hg. Yeh et Gj. Chang, Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs, THEOR COMP, 263(1-2), 2001, pp. 3-8
Citations number
21
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
263
Issue
1-2
Year of publication
2001
Pages
3 - 8
Database
ISI
SICI code
0304-3975(20010728)263:1-2<3:WCKAWK>2.0.ZU;2-3
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 pap er presents efficient algorithms for solving the weighted connected k-domin ation and the weighted k-dominating clique problems in distance-hereditary graphs, (C) 2001 Elsevier Science B.V. All rights reserved.