GENERATING K-ARY TREES IN LEXICOGRAPHIC ORDER

被引：0
|
作者：
ZHU, Y [1 ]
WANG, J [1 ]
机构：
[1] ACAD SINICA,INST APPL MATH,PEKING,PEOPLES R CHINA
来源：
SCIENTIA SINICA | 1980年 / 23卷 / 10期
关键词：
D O I：
暂无
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
引用
收藏
页码：1219 / 1225
页数：7
相关论文
共 50 条
  • [11] Antibandwidth of complete k-ary trees
    Calamoneri, Tiziana
    Massini, Annalisa
    Toeroek, L'ubomir
    Vrt'o, Imrich
    DISCRETE MATHEMATICS, 2009, 309 (22) : 6408 - 6414
  • [12] Protected points in k-ary trees
    Mansour, Toufik
    APPLIED MATHEMATICS LETTERS, 2011, 24 (04) : 478 - 480
  • [13] Parallel generation of k-ary trees
    Vajnovszki, V
    Phillips, C
    HIGH PERFORMANCE COMPUTING ON THE INFORMATION SUPERHIGHWAY - HPC ASIA '97, PROCEEDINGS, 1997, : 117 - 121
  • [14] Recursive Generation of k-ary Trees
    Manes, K.
    Sapounakis, A.
    Tasoulas, I.
    Tsikouras, P.
    JOURNAL OF INTEGER SEQUENCES, 2009, 12 (07)
  • [15] Systolic generation of k-ary trees
    Lesi, Vincent Vajnovszki
    Parallel Processing Letters, 1999, 9 (01): : 93 - 101
  • [16] On k-ary spanning trees of tournaments
    Lu, XY
    Wang, DW
    Chang, GJ
    Lin, IJ
    Wong, CK
    JOURNAL OF GRAPH THEORY, 1999, 30 (03) : 167 - 176
  • [17] Generation of k-ary and (k,m)-ary Trees in A-order Using z-Sequences
    Payaman, N. A. Ashrafi
    INFORMATION AND COMMUNICATION TECHNOLOGIES, 2010, 101 : 330 - 335
  • [18] On k-ary Lyndon Words and their Generating Functions
    Kucukoglu, Irem
    Simsek, Yilmaz
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2016 (ICNAAM-2016), 2017, 1863
  • [19] Constructing de Bruijn sequences with co-lexicographic order: The k-ary Grandmama sequence
    Dragon, Patrick Baxter
    Hernandez, Oscar I.
    Sawada, Joe
    Williams, Aaron
    Wong, Dennis
    EUROPEAN JOURNAL OF COMBINATORICS, 2018, 72 : 1 - 11
  • [20] The rotation graph of k-ary trees is Hamiltonian
    Huemer, Clemens
    Hurtado, Ferran
    Pfeifle, Julian
    INFORMATION PROCESSING LETTERS, 2008, 109 (02) : 124 - 129
12345