Efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network

Authors:
Yan Wang;Deqiang Wang;Wei Liu;Baoyu Tian
Affiliations:
Dalian Maritime University, Dalian, China;Dalian Maritime University, Dalian, China;Dalian Maritime University, Dalian, China;Dalian Maritime University, Dalian, China
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 7
Cited 0

Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time

SIAM Journal on Computing
An optimally efficient selection algorithm

Information Processing Letters
An introduction to parallel algorithms

An introduction to parallel algorithms
Algorithms for a core and k-tree core of a tree

Journal of Algorithms
Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel

IEEE Transactions on Parallel and Distributed Systems
Research note: Parallel algorithms for tree accumulations

Journal of Parallel and Distributed Computing
Parallel tree contraction and its application

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose two efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network, respectively. Both algorithms take O(log n) time using O(n) work on the EREW PRAM. Our algorithms improve the algorithms previously proposed by Wang (IEEE Trans. Par. Dist. Sys. 1998) and Peng et al. (J. Algorithms 1993).