Efficient parallel algorithms for optimally locating a k-leaf tree in a tree network

Abstract

In this paper, an efficient parallel algorithm is proposed for finding a k-tree core of a tree network. The proposed algorithm performs on the EREW PRAM in O(log n log* n) time using O(n) work.