Efficient Algorithms for Constructing a (k, l)- Center and a (k, l)- Core in a Tree Network

A (k, l)-center of a tree network is a subtree with exactly k leaves and with a diameter of at most l, which minimizes the distance from the farthest vertex to the subtree. A (k, l)-core of a tree network is a subtree with exactly k leaves and with a diameter of at most l, which minimizes the sum of the distances of the vertices from the selected subtree. In this paper, two efficient parallel algorithms are presented for constructing a (k, l)-core and a (k, l)-center of a tree network. The algorithms of this paper proposed which performed on the EREW PRAM in time using work.