ON THE EXTERNAL PATH LENGTH OF RANDOM RECURSIVE k-ARY TREES

被引：0
|
作者：
Javanian, Mehri [1 ]
机构：
[1] Univ Zanjan, Fac Sci, Dept Stat, Zanjan, Iran
来源：
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2013年 / 31期
关键词：
Recursive trees; path length;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we determine the expectation and variance of Xi, the external path length in a random recursive k-ary tree of size n.
引用
收藏
页码：21 / 26
页数：6
相关论文
共 50 条
  • [31] EFFICIENT GENERATION OF K-ARY TREES IN NATURAL ORDER
    ER, MC
    COMPUTER JOURNAL, 1992, 35 (03): : 306 - 308
  • [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] Loopless generation of Gray codes for k-ary trees
    Korsh, JE
    LaFollette, P
    INFORMATION PROCESSING LETTERS, 1999, 70 (01) : 7 - 11
  • [35] An improved succinct representation for dynamic k-ary trees
    Arroyuelo, Diego
    COMBINATORIAL PATTERN MATCHING, 2008, 5029 : 277 - 289
  • [36] Non-blocking k-ary search trees
    Theory Group, Dept. of Computer Science, University of Toronto, Canada
    不详
    Lect. Notes Comput. Sci., (207-221):
  • [37] Non-blocking k-ary Search Trees
    Brown, Trevor
    Helga, Joanna
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2011, 7109 : 207 - +
  • [38] Line-broadcasting in complete k-ary trees
    Shabtai, Revital Hollander
    Roditty, Yehuda
    NETWORKS, 2016, 67 (02) : 139 - 147
  • [39] Counting Vertices with Given Outdegree in Plane Trees and k-ary Trees
    Rosena R. X. Du
    Jia He
    Xueli Yun
    Graphs and Combinatorics, 2019, 35 : 221 - 229
  • [40] Counting Vertices with Given Outdegree in Plane Trees and k-ary Trees
    Du, Rosena R. X.
    He, Jia
    Yun, Xueli
    GRAPHS AND COMBINATORICS, 2019, 35 (01) : 221 - 229
12345