Article citationsMore>>

Drmota, M. (2009) Random Trees. Springer, Wien, New York.
https://doi.org/10.1007/978-3-211-75357-6

has been cited by the following article:

• TITLE: Counting and Randomly Generating k-Ary Trees

  AUTHORS: James F. Korsh

  KEYWORDS: Combinatorial Problems, k-Ary Trees, Random Generation

  JOURNAL NAME: Applied Mathematics, Vol.12 No.12, December 23, 2021

  ABSTRACT: k-ary trees are one of the most basic data structures in Computer Science. A new method is presented to determine how many there are with n nodes. This method gives additional insight into their structure and provides a new algo-rithm to efficiently generate such a tree randomly.