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
来源：
INFORMATION PROCESSING LETTERS | 1999年 / 70卷 / 01期
关键词：
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 条
  • [31] BRANCHES IN RANDOM RECURSIVE k-ARY TREES
    Javanian, M.
    Vahidi-Asl, M. Q.
    BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2012, 38 (02) : 323 - 331
  • [32] On generating k-ary trees in computer representation
    Xiang, LM
    Ushijima, K
    Tang, CJ
    INFORMATION PROCESSING LETTERS, 2001, 77 (5-6) : 231 - 238
  • [33] Antimagic orientations for the complete k-ary trees
    Chen Song
    Rong-Xia Hao
    Journal of Combinatorial Optimization, 2019, 38 : 1077 - 1085
  • [34] Complete k-ary trees and Hamming graphs
    Choudum, S. A.
    Lavanya, S.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2009, 45 : 15 - 24
  • [35] Scaling limits of k-ary growing trees
    Haas, Benedicte
    Stephenson, Robin
    ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2015, 51 (04): : 1314 - 1341
  • [36] Formalisation and implementation aspects of K-ary (malicious) codes
    Eric Filiol
    Journal in Computer Virology, 2007, 3 (2): : 75 - 86
  • [37] Formalisation and implementation aspects of K-ary (malicious) codes
    Filiol, Eric
    JOURNAL IN COMPUTER VIROLOGY AND HACKING TECHNIQUES, 2007, 3 (02): : 75 - 86
  • [38] A-order generation of k-ary trees with a 4k-4 letter alphabet
    Korsh, J. F.
    Journal of Information & Optimization Sciences, 1995, 16 (03):
  • [39] Restricted rotation distance between k-ary trees
    Cleary S.
    Journal of Graph Algorithms and Applications, 2023, 27 (01) : 19 - 33
  • [40] Optimal parallel algorithm for generating k-ary trees
    Vajnovszki, V
    Phillips, C
    COMPUTERS AND THEIR APPLICATIONS: PROCEEDINGS OF THE ISCA 12TH INTERNATIONAL CONFERENCE, 1997, : 201 - 204
12345