An Efficient Parallel Algorithm for Finding the (K,L)-Center of Tree Networks

D. Wang, Y. Li, Y. Wang, and K. Wang (PRC)


tree, center, parallel algorithm, EREW PRAM.


This paper research on how to select a subtree with exactly k leaves and a diameter of at most l, which minimizes the distance from the farthest vertex to the subtree. We call such a subtree (k, l)-center of a tree network. In this pa per, an efficient parallel algorithm is proposed for finding a (k, l)-center of a tree network. This algorithm performs on the EREW PRAM in O(log n) time using O(n) work.

Important Links:

Go Back