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.
- Title
- Efficient parallel algorithms for optimally locating a k-leaf tree in a tree network
- Creators - without role
- Shan-Chyun Ku - Natl Tsing Hua UnivWei-Kuan Shih - Natl Tsing Hua UnivBiing-Feng Wang - Natl Tsing Hua Univ
- Publication Details
- Proceedings of the International Conference on Parallel Processing, pp.16-19
- Grant note
- IEEE
- Identifiers
- 9957766566106774
- Academic Unit
- Department of Computer Science, College of Electrical Engineering and Computer Science, National Tsing Hua University
- Language
- English
- Resource Type
- Conference paper