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

Authors:
Hong-Gwa Yeh;Gerard J. Chang
Affiliations:
National Central University, Chungli, Taiwan;National Chiao Tung University, Hsinchu, Taiwan
Venue:
Theoretical Computer Science
Year:
2001

Citing 15
Cited 7

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
On domination problems for permutation and other graphs

Theoretical Computer Science
Distance-hereditary graphs, Steiner trees, and connected domination

SIAM Journal on Computing
Labeling algorithms for domination problems in sun-free chordal graphs

Discrete Applied Mathematics
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Dominating cliques in graphs

Discrete Mathematics - Topics on domination
Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs

Discrete Mathematics - Topics on domination
Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs

Theoretical Computer Science
Domination on cocomparability graphs

SIAM Journal on Discrete Mathematics
Dominating cliques in chordal graphs

Discrete Mathematics
The algorithmic use of hypertree structure and maximum neighbourhood orderings

Discrete Applied Mathematics
Weighted connected domination and Steiner trees in distance-hereditary graphs

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Dominating Cliques in Distance-Hereditary Graphs

SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Dominating Cliques in Graphs with Hypertree Structures

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science

An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs

Journal of Parallel and Distributed Computing
The Hamiltonian problem on distance-hereditary graphs

Discrete Applied Mathematics
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs

The Journal of Supercomputing
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

Theoretical Computer Science
The Hamiltonian problem on distance-hereditary graphs

Discrete Applied Mathematics
Note: A note on connected dominating sets of distance-hereditary graphs

Discrete Applied Mathematics
Distance-hereditary comparability graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

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.