Premium
The climbing depth of random trees
Author(s) -
Panholzer Alois
Publication year - 2004
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20047
Subject(s) - struct , climb , tree (set theory) , random tree , climbing , mathematics , combinatorics , computer science , artificial intelligence , geography , engineering , archaeology , motion planning , robot , programming language , aerospace engineering
We study here for certain rooted tree families the number of steps that are necessary to climb a random tree of size n . We give distributional results for this parameter for increasing tree families and unordered unlabeled rooted trees. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2005
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom