Title :
Parallel algorithms for the tree bisector problem and applications
Author :
Wang, Biing-Feng ; Ku, Shan-Chyun ; Shi, Keng-Hua ; Hung, Ting-Kai ; Liu, Pei-Sen
Author_Institution :
Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
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
Keywords :
computational complexity; computational geometry; concurrency theory; parallel algorithms; EREW PRAM; parallel algorithms; single-source algorithms; tree bisector problem; Application software; Computer industry; Computer science; Joining processes; Parallel algorithms; Phase change random access memory;
Conference_Titel :
Parallel Processing, 1999. Proceedings. 1999 International Conference on
Conference_Location :
Aizu-Wakamatsu City
Print_ISBN :
0-7695-0350-0
DOI :
10.1109/ICPP.1999.797404
