Loop free generation of k-ary trees

被引:0
|
作者
Roelants Van Baronaigien, Dominique [1 ]
机构
[1] Department of Computer Science, University of Victoria, P.O. Box 3055, Victoria, BC V8W 3P6, Canada
关键词
The author would like to thank the referee for the suggested improvements; and the National Sciences and Engineering Research Council of Canada for their support of this research work under grant number 89767;
D O I
暂无
中图分类号
学科分类号
摘要
15
引用
收藏
页码:183 / 200
相关论文
共 50 条
  • [31] A-order generation of k-ary trees with a 4k-4 letter alphabet
    Korsh, J. F.
    Journal of Information & Optimization Sciences, 1995, 16 (03):
  • [32] Restricted rotation distance between k-ary trees
    Cleary S.
    Journal of Graph Algorithms and Applications, 2023, 27 (01) : 19 - 33
  • [33] 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
  • [34] ON ALPHABETICAL k-ARY TREES WITH RESTRICTED PATH LENGTH
    朱永津
    王建方
    A Monthly Journal of Science, 1981, (02) : 97 - 101
  • [35] Depth of nodes in random recursive k-ary trees
    Javanian, M
    Vahidi-Asl, MQ
    INFORMATION PROCESSING LETTERS, 2006, 98 (03) : 115 - 118
  • [36] An improved succinct representation for dynamic k-ary trees
    Arroyuelo, Diego
    COMBINATORIAL PATTERN MATCHING, 2008, 5029 : 277 - 289
  • [37] Non-blocking k-ary search trees
    Theory Group, Dept. of Computer Science, University of Toronto, Canada
    不详
    Lect. Notes Comput. Sci., (207-221):
  • [38] Non-blocking k-ary Search Trees
    Brown, Trevor
    Helga, Joanna
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2011, 7109 : 207 - +
  • [39] Line-broadcasting in complete k-ary trees
    Shabtai, Revital Hollander
    Roditty, Yehuda
    NETWORKS, 2016, 67 (02) : 139 - 147
  • [40] Generation of assembly sequences with k-ary operations
    Wang, Haixia
    Ceglarek, Dariusz J.
    2007 IEEE INTERNATIONAL SYMPOSIUM ON ASSEMBLY AND MANUFACTURING, 2007, : 50 - +