Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network

Authors:
Shan-Chyun Ku;Wei Kuan Shih;Biing-Feng Wang
Affiliations:
-;-;-
Venue:
ICPP '97 Proceedings of the international Conference on Parallel Processing
Year:
1997

Citing 5
Cited 2

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
An introduction to parallel algorithms

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

Journal of Algorithms

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
Distributed algorithms for finding and maintaining a k-tree core in a dynamic network

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.