Barcucci, E., Del Lungo, A. and Pergola, E. (1999) Random Generation of Trees and Other Combinatorial Objects. Theoretical Computer Science, 218, 219-232.
https://doi.org/10.1016/S0304-3975(98)00322-3

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.