Ranking and unranking algorithms for loopless generation of t-ary trees

作者：Ahmadi Adl Amin^*; Nowzari Dalini Abbas; Ahrabian Hayedeh

来源：Logic Journal of the IGPL, 2011, 19(1): 33-43.

DOI：10.1093/jigpal/jzp097

• Generation algorithm
• Gray-code
• ranking and unranking algorithms

In this paper, we present two new ranking and unranking algorithms for z-sequences in Gray-code order. These algorithms are designed based on a loopless generation algorithm which is given for z-sequences corresponding to t-ary trees by Roelants van Baronaigien and Xiang et al. Up to our knowledge no other ranking and unranking algorithms are given for Gray-codes corresponding to t-ary trees. The time complexity of both algorithms for t-ary trees with n nodes is O(n(2)t).

• 出版日期2011-2