Generating random binary trees -- a survey
From MaRDI portal
Publication:1818783
DOI10.1016/S0020-0255(98)10080-4zbMath0952.68103MaRDI QIDQ1818783
Publication date: 4 January 2000
Published in: Information Sciences (Search for Journal in Brave)
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Pareto quantiles of unlabeled tree objects ⋮ Minimizing I/Os in Out-of-Core Task Tree Scheduling ⋮ LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs ⋮ Unnamed Item ⋮ Generating strictly binary trees at random based on convex polygon triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniform generation of a Schröder tree
- Fast random generation of binary, t-ary and other types of trees
- A linear-time algorithm for the generation of trees
- Generating binary trees with uniform probability
- An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes
- The generation of random, binary unordered trees
- Lexicographic generation of ordered trees
- Generating binary trees at random
- A heuristic method for generating large random expressions
- A method and two algorithms on the theory of partitions
- Generating words in a context-free language uniformly at random
- A calculus for the random generation of labelled combinatorial structures
- The random generation of directed animals
- Counting and randomly generating binary trees
- A Survey on Binary Tree Codings
- Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
- Enumerating, Ranking and Unranking Binary Trees
- Generating binary trees using rotations
- On random and adaptive parallel generation of combinatorial objects
- On Rotations and the Generation of Binary Trees
- The generation of binary trees as a numerical problem
- On the Generation of Random Binary Search Trees
- Random generation of colored trees
- Functional Composition Patterns and Power Series Reversion
- Left distance binary tree representations
