Parallel Algorithms for the Tree Bisector Problem and Applications

Authors:
Biing-Feng Wang;Shan-Chyun Ku;Keng-Hua Shi;Ting-Kai Hung;Pei-Sen Liu
Affiliations:
-;-;-;-;-
Venue:
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Year:
1999

Citing 0
Cited 3

Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems

IEEE Transactions on Parallel and Distributed Systems
Finding a Two-Core of a Tree in Linear Time

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Efficient Algorithms for Two Generalized 2-Median Problems on Trees

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An edge is a bisector of a simple path if it contains the middle point of the path. In this paper, efficient parallel algorithms are proposed on the EREW PRAM for the single-source and all-pairs tree bisector problems. Two O(log n) time single-source algorithms are proposed. One uses O(n) work and the other uses O(nlog n) work. The one using O(n) work is more efficient but only applicable to unweighted trees. One all-pairs parallel algorithm is proposed. It requires O(log n) time using O(n2) work.