An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs

Authors:
Sun-yuan Hsieh
Affiliations:
-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2002

Citing 18
Cited 2

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
Distance-hereditary graphs, Steiner trees, and connected domination

SIAM Journal on Computing
Binary tree algebraic computation and parallel algorithms for simple graphs

Journal of Algorithms
A simple parallel tree contraction algorithm

Journal of Algorithms
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Efficient parallel algorithms for series parallel graphs

Journal of Algorithms
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs

Information Processing Letters
Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs

Information Processing Letters
Weighted independent perfect domination on cocomparability graphs

Discrete Applied Mathematics
Powers of distance-hereditary graphs

Discrete 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
A faster implementation of a parallel tree contraction scheme and its application on distance-hereditary graphics

Journal of Algorithms
Dominating Cliques in Distance-Hereditary Graphs

SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Effincient Domination of Permutation Graphs and Trapezoid Graphs

COCOON '97 Proceedings of the Third 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)

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

Journal of Parallel and Distributed Computing
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the literature, there are quite a few sequential and parallel algorithms for solving problems on distance-hereditary graphs. With an n-vertex and m-edge distance-hereditary graph G, we show that the efficient domination problem on G can be solved in \big. O(\log^{2} n)\bigr. time using \big. O(n+m)\bigr. processors on a CREW PRAM. Moreover, if a binary tree representation of G is given, the problem can be optimally solved in \big. O(\log n)\bigr. time using \big. O(n/\log n)\bigr. procssors on an EREW PRAM.