Loopless generation of Gray codes for k-ary trees

被引:27
作者
Korsh, JE [1 ]
LaFollette, P [1 ]
机构
[1] Temple Univ, Dept CIS, Philadelphia, PA 19122 USA
关键词
combinatorial problems; Gray codes; k-ary trees; loopless generation;
D O I
10.1016/S0020-0190(99)00035-6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A number of loopless binary and k-ary tree generation algorithms are known. Vajnovszki recently presented a loopless Gray code generation algorithm for binary trees based on rotations and variations. He used a representation introduced by Pallo and generated the Gray code of Roelants van Baronaigien and Ruskey. In this paper we generalize the representation to k-ary trees and base the loopless generation algorithm on the shifts of Korsh and Lipschutz. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:7 / 11
页数:5
相关论文
共 28 条
  • [21] Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence1
    Wu, Ro-Yu
    Chang, Jou-Ming
    Wang, Yue-Li
    [J]. COMPUTER JOURNAL, 2010, 53 (06) : 661 - 666
  • [22] LEE DISTANCE AND TOPOLOGICAL PROPERTIES OF K-ARY N-CUBES
    BOSE, B
    BROEG, B
    KWON, Y
    ASHIR, Y
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (08) : 1021 - 1030
  • [23] Toward Self-Adjusting k-Ary Search Tree Networks
    Feder, Evgeniy
    Paramonov, Anton
    Mavrin, Pavel
    Salem, Iosif
    Schmid, Stefan
    Aksenov, Vitaly
    [J]. 2024 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, IPDPSW 2024, 2024, : 1209 - 1211
  • [24] Efficient Generation, Ranking, and Unranking of (k, m)-Ary Trees in B-Order
    Amani, M.
    Nowzari-Dalini, A.
    [J]. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2019, 45 (04) : 1145 - 1158
  • [25] Ranking and Unranking t-ary Trees in a Gray-Code Order
    Wu, Ro-Yu
    Chang, Jou-Ming
    Chen, An-Hang
    Liu, Chun-Liang
    [J]. COMPUTER JOURNAL, 2013, 56 (11) : 1388 - 1395
  • [26] Constructions and Bounds for q-Ary (1, k)-Overlap-Free Codes
    Cai, Qinlin
    Wang, Xiaomiao
    Feng, Tao
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (06) : 4439 - 4444
  • [27] Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
    Conflitti, Alessandro
    Mamede, Ricardo
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 592 : 87 - 96
  • [28] Gray Codes Generation Algorithm and Theoretical Evaluation of Random Walks in N-Cubes
    Contassot-Vivier, Sylvain
    Couchot, Jean-Francois
    Heam, Pierre-Cyrille
    [J]. MATHEMATICS, 2018, 6 (06):