Fast random generation of binary, t-ary and other types of trees
From MaRDI portal
Publication:582880
Recommendations
Cites work
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3535592 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes
- Generating t-Ary Trees Lexicographically
- Ranking and Listing Algorithms for k-Ary Trees
- The distance between points in random trees
- The distribution of degrees in a large random tree
- The generation of random, binary unordered trees
Cited in
(16)- Random generation of colored trees
- Growing random uniform \(d\)-ary trees
- scientific article; zbMATH DE number 1472143 (Why is no real title available?)
- Birth and death chains on finite trees: computing their stationary distribution and hitting times
- Uniform generation of forests of restricted height
- Generating binary trees with uniform probability
- The generation of random, binary unordered trees
- scientific article; zbMATH DE number 3900794 (Why is no real title available?)
- Generating binary trees at random
- Generating random binary trees -- a survey
- Generating strictly binary trees at random based on convex polygon triangulations
- Binarization Trees and Random Number Generation
- Uniform generation of binary trees in parallel
- Probabilistic models in cluster analysis
- Fast generation of unlabelled free trees using weight sequences
- On Generating Random Network Structures: Trees
This page was built for publication: Fast random generation of binary, t-ary and other types of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582880)