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

Authors:
Sun-Yuan Hsieh
Affiliations:
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan
Venue:
The Journal of Supercomputing
Year:
2007

Citing 24
Cited 0

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
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
A simple parallel tree contraction algorithm

Journal of Algorithms
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
The weighted perfect domination problem

Information Processing Letters
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
An introduction to parallel algorithms

An introduction to parallel algorithms
Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs

Information Processing Letters
Dominating sets in n-cubes

Journal of Graph Theory
Efficient parallel recognition algorithms of cographs and distance hereditary graphs

Discrete Applied Mathematics
The weighted perfect domination problem and its variants

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

Discrete Applied Mathematics
R-Domination in Graphs

Journal of the ACM (JACM)
A faster implementation of a parallel tree contraction scheme and its application on distance-hereditary graphics

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

Theoretical Computer Science
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

Theoretical Computer Science
Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs

SIAM Journal on Discrete Mathematics
An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs

IEEE Transactions on Parallel and Distributed Systems
Dominating Cliques in Distance-Hereditary Graphs

SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Dynamic Programming on Distance-Hereditary Graphs

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.00

Visualization

Abstract

A graph is distance-hereditary if the distance stays the same between any of two vertices in every connected induced subgraph containing both. Two well-known classes of graphs, trees and cographs, both belong to distance-hereditary graphs. In this paper, we first show that the perfect domination problem can be solved in sequential linear-time on distance-hereditary graphs. By sketching some regular property of the problem, we also show that it can be easily parallelized on distance-hereditary graphs.