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

被引:10
|
作者
Ahmadi-Adl, Amin [1 ]
Nowzari-Dalini, Abbas [1 ]
Ahrabian, Hayedeh [1 ]
机构
[1] Univ Tehran, Ctr Excellence Bioinformat, Sch Math Stat & Comp Sci, Tehran, Iran
关键词
Generation algorithm; Gray-code; ranking and unranking algorithms; PARALLEL GENERATION; BINARY-TREES; GRAY CODES;
D O I
10.1093/jigpal/jzp097
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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).
引用
下载
收藏
页码:33 / 43
页数:11
相关论文
共 50 条
  • [1] Ranking and Unranking t-ary Trees in a Gray-Code Order
    Wu, Ro-Yu
    Chang, Jou-Ming
    Chen, An-Hang
    Liu, Chun-Liang
    COMPUTER JOURNAL, 2013, 56 (11): : 1388 - 1395
  • [2] Ranking and Unranking of t-Ary Trees Using RD-Sequences
    Wu, Ro-Yu
    Chang, Jou-Ming
    Wang, Yue-Li
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011, E94D (02): : 226 - 232
  • [3] A parallel dynamic programming algorithm for unranking t-ary trees
    Kokosinski, Z
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2004, 3019 : 255 - 260
  • [4] LEXICOGRAPHIC LISTING AND RANKING OF T-ARY TREES
    ER, MC
    COMPUTER JOURNAL, 1987, 30 (06): : 569 - 572
  • [5] Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees
    Chang, Yu-Hsuan
    Wu, Ro-Yu
    Chang, Ruay-Shiung
    Chang, Jou-Ming
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2019, 2019, 11640 : 16 - 28
  • [6] Fast Generation of t-ary Trees
    Korsh, James F.
    COMPUTER JOURNAL, 2011, 54 (05): : 776 - 785
  • [7] Parallel generation of t-ary trees in A-order
    Ahrabiani, H.
    Nowzari-Dalini, A.
    COMPUTER JOURNAL, 2007, 50 (05): : 581 - 588
  • [8] Generation of t-ary trees with Ballot-sequences
    Ahrabian, H
    Nowzari-Dalini, A
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (10) : 1243 - 1249
  • [9] On parallel generation of t-ary trees in an associative model
    Kokosinski, Z
    PARALLEL PROCESSING APPLIED MATHEMATICS, 2002, 2328 : 228 - 235
  • [10] Improved algorithms for ranking and unranking (k, m)-ary trees in B-order
    Yu-Hsuan Chang
    Ro-Yu Wu
    Ruay-Shiung Chang
    Jou-Ming Chang
    Journal of Combinatorial Optimization, 2022, 44 : 1495 - 1510