The climbing depth of random trees

Emerging

3
Citations
23
Refs
2004
Year
Search Works
Work Details
  • DOI 10.1002/rsa.20047
  • OpenAlex ID W4248554653
  • Type Article
  • Language EN
  • Published 23 Nov 2004
  • Volume 26 (1-2)
  • Pages 84–109
  • Source Random Structures and Algorithms
  • Publisher Wiley
  • FWCI 1.79
  • Countries 1
  • Institutions 1
  • Added 10 Oct 2025
  • Updated 14 Oct 2026
External Links
OpenAlex Record DOI Resolver
MENU
0

The climbing depth of random trees

Article 2004 EN

Abstract 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

3

Citations

23

References

1

Authors

1.79

FWCI

Topics
Keywords
Authors & Affiliations
1 authors
#AuthorInstitutionsORCID
1 Alois Panholzer Corresponding TU Wien (AT)
Related Works
10

Data: OpenAlex