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 条

[41] A Model of Forming a Simple Path in a Level of a Complete K-ary Tree Maximizing Total Shortening Path Length
Sawada, Kiyoshi
INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III, 2010, : 2028 - 2031
[42] Embedding of k-ary complete trees into hypercubes with uniform load
Trdlicka, J
Tvrdik, P
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 52 (02) : 120 - 131
[43] SELF-ADJUSTING K-ARY SEARCH-TREES
SHERK, M
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 382 : 381 - 392
[44] A Subfamily of Skew Dyck Paths Related to k-ary Trees
Zhang, Yuxuan
Zhuang, Yan
JOURNAL OF INTEGER SEQUENCES, 2024, 27 (02)
[45] SELF-ADJUSTING K-ARY SEARCH-TREES
SHERK, M
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1995, 19 (01): : 25 - 44
[46] Efficient loopless generation of Gray codes for k-ary trees
Xiang, LM
Ushijima, K
Tang, CJ
INFORMATION PROCESSING LETTERS, 2000, 76 (4-6) : 169 - 174
[47] Grammar-oriented enumeration of arbitrary trees and arbitrary k-ary trees
Xiang, LM
Ushijima, K
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1999, E82D (09) : 1245 - 1253
[48] Embedding of k-ary complete trees into hypercubes with optimal load
Trdlicka, J
Tvrdik, P
EIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1996, : 600 - 607
[49] ON THE K-ARY HYPERCUBE
BETTAYEB, S
THEORETICAL COMPUTER SCIENCE, 1995, 140 (02) : 333 - 339
[50] 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

← 1 2 3 4 5 →