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
相关论文
共 50 条
  • [21] GENERATING k-ARY TREES IN LEXICOGRAPHIC ORDER
    朱永津
    王建方
    Science China Mathematics, 1980, (10) : 1219 - 1225
  • [22] Antimagic orientations for the complete k-ary trees
    Song, Chen
    Hao, Rong-Xia
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (04) : 1077 - 1085
  • [23] RANKING AND LISTING ALGORITHMS FOR K-ARY TREES
    TROJANOWSKI, AE
    SIAM JOURNAL ON COMPUTING, 1978, 7 (04) : 492 - 509
  • [24] Generating regular k-ary trees efficiently
    Xiang, Limin, 1600, Oxford Univ Press, Oxford, United Kingdom (43):
  • [25] EMBEDDING K-ARY COMPLETE TREES INTO HYPERCUBES
    SHEN, XJ
    HU, Q
    LIANG, WF
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 24 (01) : 100 - 106
  • [26] The rotation graph of k-ary trees is Hamiltonian
    Huemer, Clemens
    Hurtado, Ferran
    Pfeifle, Julian
    INFORMATION PROCESSING LETTERS, 2008, 109 (02) : 124 - 129
  • [27] Generating regular k-ary trees efficiently
    Xiang, LM
    Ushijima, K
    Akl, SG
    COMPUTER JOURNAL, 2000, 43 (04): : 290 - 300
  • [28] THE REPRESENTATION AND ENUMERATION OF ORDERED K-ARY TREES
    MARTIN, HW
    KILTINEN, JO
    MCNEILL, RB
    COMPUTING AND INFORMATION, 1989, : 105 - 109
  • [29] Note on the Exponential Recursive k-Ary Trees
    Ghasemi, Mina
    Javanian, Mehri
    Nabiyyi, Ramin Imany
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2023, 57 : 16 - 32
  • [30] k-Ary spanning trees contained in tournaments
    Ai, Jiangdong
    Lei, Hui
    Shi, Yongtang
    Yao, Shunyu
    Zhang, Zan-Bo
    DISCRETE APPLIED MATHEMATICS, 2020, 285 : 141 - 146