Issue No. 02 - February (1998 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.663884
<p><b>Abstract</b>—A <it>k</it>-tree core of a tree network is a subtree with exactly <it>k</it> leaves that minimizes the total distance from vertices to the subtree. A <it>k</it>-tree center of a tree network is a subtree with exactly <it>k</it> leaves that minimizes the distance from the farthest vertex to the subtree. In this paper, two efficient parallel algorithms are proposed for finding a <it>k</it>-tree core and a <it>k</it>-tree center of a tree network, respectively. Both the proposed algorithms perform on the EREW PRAM in <it>O</it>(log <it>n</it> log* <it>n</it>) time using <it>O</it>(<it>n</it>) work (time-processor product). Besides being efficient on the EREW PRAM, in the sequential case, our algorithm for finding a <it>k</it>-tree core of a tree network improves the two algorithms previously proposed in [<ref rid="bibl018610" type="bib">10</ref>].</p>
Trees, cores, centers, tree contraction, the Euler-tour technique.
Biing-Feng Wang, "Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel", IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 186-191, February 1998, doi:10.1109/71.663884