Title of article
Parallel Generation of t-ary Trees.
Author/Authors
Ahrabian, H. university of tehran - Faculty of Sciences - Department of Mathematics and Computer Science, تهران, ايران , Nowzari-Dalini, A. university of tehran - Faculty of Sciences - Department of Mathematics and Computer Science, تهران, ايران
From page
169
To page
173
Abstract
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time complexity, and ranking and unranking algorithms with O(t n) time complexity is also given.
Keywords
t , ary Trees , Parallel algorithm , B , order , 0 , 1 Sequences , Recursion.
Journal title
Journal of Sciences Islamic Republic of Iran
Journal title
Journal of Sciences Islamic Republic of Iran
Record number
2579915
Link To Document