When an undirected tree,T, and a vertex,r, in the tree are given, the problem to transformT into a rooted tree withr as its root is considered. Using Euler tour and prefix sum, an optimal algorithm has been developed [2, 3]. We will present another parallel algorithm which is optimal also on EREW PRAM. Our approach reduces the given tree step by step by pruning and pointer jumping. That is, the tree structure is retained during algorithm processing such that another tree computations can be carried out in parallel.
AMS Mathematics Subject Classification
Key word and phrases
parallel algorithms trees rooted trees PRAM model
This is a preview of subscription content, log in to check access.
R. Cole and U. Vishkin,Apprximate parallel sheduling, Part 1: The basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Computing, Vol. 17(1988), No. 1, 128–142.MATHCrossRefMathSciNetGoogle Scholar
J. JaJa,An introduction to parallel algorithms, Addison Wesley, 1992.Google Scholar
R. E. Tarjan and U. Vishkin,Finding biconnected components and computing tree functions in logarithmic parallel time, SIAM J. Computing, Vol. 14(1985), No. 4, 862–874.MATHCrossRefMathSciNetGoogle Scholar
J. C. Wyllie,The complexity of parrel computations, Ph D thesis, Computer Science Department, Conell University, Ithaca, NY, 1979.Google Scholar