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

Authors:
Biing-Feng Wang
Affiliations:
National Tsing Hua Univ., Hsinchu, Taiwan
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1998

Citing 6
Cited 6

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
Parallel merge sort

SIAM Journal on Computing
A simple parallel tree contraction algorithm

Journal of Algorithms
An introduction to parallel algorithms

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

Journal of Algorithms

Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems

IEEE Transactions on Parallel and Distributed Systems
Cluster based routing using a k-tree core backbone for mobile ad hoc networks

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Finding a Two-Core of a Tree in Linear Time

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Parallel processing algorithms for content-based retrieval from a multimedia database

TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
A route-aware MAC for wireless multihop networks with a convergecast traffic pattern

Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A k-tree core of a tree network is a subtree with exactly k leaves that minimizes the total distance from vertices to the subtree. A k-tree center of a tree network is a subtree with exactly k leaves that minimizes the distance from the farthest vertex to the subtree. In this paper, two efficient parallel algorithms are proposed for finding a k-tree core and a k-tree center of a tree network, respectively. Both the proposed algorithms perform on the EREW PRAM in O(log n log* n) time using O(n) work (time-processor product). Besides being efficient on the EREW PRAM, in the sequential case, our algorithm for finding a k-tree core of a tree network improves the two algorithms previously proposed in [10].