Fast random generation of binary, t-ary and other types of trees

DOI10.1007/BF01908600zbMath0691.68019MaRDI QIDQ582880

Adolfo J. Quiroz

Publication date: 1989

Published in: Journal of Classification (Search for Journal in Brave)

zbMATH Keywords

tree algorithmsMonte Carlo studiesclustering methodology

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (3)

Birth and death chains on finite trees: computing their stationary distribution and hitting times ⋮ Probabilistic models in cluster analysis ⋮ Generating random binary trees -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes
• The generation of random, binary unordered trees
• The distribution of degrees in a large random tree
• Ranking and Listing Algorithms for k-Ary Trees
• Generating t-Ary Trees Lexicographically
• The distance between points in random trees

This page was built for publication: Fast random generation of binary, t-ary and other types of trees