Cascading divide-and-conquer: a technique for designing parallel algorithms
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
A general approach to dominance in the plane
Journal of Algorithms
Fundamentals of Data Structures in Pascal
Fundamentals of Data Structures in Pascal
Theoretical Computer Science
Unified parallel encoding and decoding algorithms for Dandelion-like codes
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A tree T is labeled when the n vertices are distinguished from one another by names such as $v_1, v_2 \cdots, v_n.$ Two labeled trees are considered to be distinct if they have different vertex labels even though they might be isomorphic. According to Cayley's tree formula, there are nn驴2 labeled trees on n vertices. Prüfer used a simple way to prove this formula and demonstrated that there exists a mapping between a labeled tree and a number sequence. From his proof, we can find a naive sequential algorithm which transfers a labeled tree to a number sequence and vice versa. However, it is hard to parallelize. In this paper, we shall propose an O(log n) time parallel algorithm for constructing a labeled tree by using O(n) processors and O(n log n) space on the EREW PRAM computational model.