Parallel Generation of t-Ary Trees in A-order

  title={Parallel Generation of t-Ary Trees in A-order},
  author={Haydeh Ahrabian and Abbas Nowzari-Dalini},
  journal={Comput. J.},
We present a cost-optimal and adaptive parallel algorithm for generating t-ary trees in A-order. The generation is based on an encoding using integer sequences (z-sequences) due to Zaks [(1980), Lexicographic generation of ordered tree. Theor. Comput. Sci., 10, 63–82]. Our algorithm is the first introduced parallel generation algorithm, which generates t-ary trees in A-order in the literature. The used computational model is CREW SM SIMD multi-processors. This algorithm is designed based on a… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
3 Extracted Citations
31 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 31 references

Ranking and unranking of k-ary trees with 4k-4 letter alphabet

  • V. Vajnovszki, J. Pallo
  • J. Inf. Optim. Sci.,
  • 1997
Highly Influential
4 Excerpts

Two optimal parallel algorithms for generating P-sequences

  • V. Vajnovszki, C. Phillips
  • Proc. 9th Int. Conf. on Parallel and Distributed…
  • 1996
Highly Influential
7 Excerpts

A-order generation of k-ary trees with 4k 2 4 letter alphabet

  • J. F. Korsh
  • J. Inf. Optim. Sci.,
  • 1995
Highly Influential
5 Excerpts

Generating binary trees in parallel

  • S. G. Akl, I. Stojmenovic
  • Proc. 30th Annual Allerton Conf. on Communication…
  • 1992
Highly Influential
7 Excerpts

Generating trees with n nodes and m leaves

  • J. Pallo
  • Int. J. Comput. Math.,
  • 1987
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…