Parallel algorithms for the tree bisector problem and applications

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 t...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 1999 International Conference on Parallel Processing pp. 192 - 199
Main Authors Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu
Format Conference Proceeding
LanguageEnglish
Published IEEE 1999
Subjects
Application software
Computer industry
Computer science
Joining processes
Parallel algorithms
Phase change random access memory
Online AccessGet full text

Cover

More Information
Summary: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(n/sup 2/) work.
ISBN:9780769503509
0769503500
ISSN:0190-3918
2332-5690
DOI:10.1109/ICPP.1999.797404