Efficient Parallel Algorithms on Distance-Hereditary Graphs

Authors:
Sun-Yuan Hsieh;Chin-Wen Ho;Gen-Huey Chen;Tsan-sheng Hsu;Ming-Tat Ko
Affiliations:
-;-;-;-;-
Venue:
ICPP '97 Proceedings of the international Conference on Parallel Processing
Year:
1997

Citing 8
Cited 2

Distance-hereditary graphs

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

SIAM Journal on Computing
Parallel merge sort

SIAM Journal on Computing
A simple parallel tree contraction algorithm

Journal of Algorithms
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Approximate parallel scheduling. II.: applications to logarithmic-time optimal parallel graph algorithms

Information and Computation
An introduction to parallel algorithms

An introduction to parallel algorithms
Efficient parallel recognition algorithms of cographs and distance hereditary graphs

Discrete Applied Mathematics

Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Parallel Decomposition of Distance-Hereditary Graphs

ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present efficient parallel algorithms for finding a minimum weighted independent set, a minimum weighted Steiner tree for a distance-hereditary graph which takes O(\log n) time using O(n+m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of a given graph, respectively. We also find a maximum weighted clique of a distance-hereditary graph in O(\log^{2} n) time using O(n+m) processors on a CREW PRAM.