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

Theoretical Computer Science

Volumn 263, Issue 1-2, 2001, Pages 3-8

  Yeh, Hong Gwa ^a   Chang, Gerard J ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Connected k domination; Distance hereditary graph; k dominating clique

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; THEOREM PROVING;

DISTANCE-HEREDITARY GRAPHS;

GRAPH THEORY;

EID: 0034922084     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00225-5     Document Type: Article

References (21)

1. The algorithmic use of hypertree structure and maximum neighborhood orderings
2. A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
3. On domination problems for permutation and other graphs
4. Distance-hereditary graphs
5. Labeling algorithms for domination problems in sun-free chordal graphs
6. The k-domination and k-stability problems on sun-free chordal graphs
7. Dominating cliques in graphs
8. Distance-hereditary graphs, Steiner trees, and connected domination
9. HT-graphs: Centers, connected r-domination and Steiner trees
10. Dominating cliques in distance-hereditary graphs
11. Dominating cliques in graphs with hypertree structure
12. Completely separable graphs
13. A characterization of distance-hereditary graphs
14. The NP-completeness column: An ongoing guide
15. Finding dominating cliques efficiently in strongly chordal graphs and undirected path graphs
16. Dominating cliques in chordal graphs
17. Domination of cocomparability graphs
18. Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
19. Algorithmic aspects of majority domination
20. Weighted connected domination and Steiner trees in distance-hereditary graphs