Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
From MaRDI portal
Recommendations
Cited in
(25)- Generating ordered trees
- A heuristic method for generating large random expressions
- Uniform generation of forests of restricted height
- Generating random binary trees -- a survey
- Efficient generation of plane trees.
- Ordered trees and the inorder traversal
- Finding the seed of uniform attachment trees
- Growing random uniform d-ary trees
- An efficient method of examining all trees
- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
- Uniform generation of a Schröder tree
- Generating trees on multisets
- scientific article; zbMATH DE number 434865 (Why is no real title available?)
- Generating rooted trees of m nodes uniformly at random
- Uniformly random tree generation
- On Generating Random Network Structures: Trees
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
- scientific article; zbMATH DE number 3961006 (Why is no real title available?)
- scientific article; zbMATH DE number 700567 (Why is no real title available?)
- Efficient enumeration of ordered trees with \(k\) leaves
- Loopless Generation of Trees with Specified Degrees
- Building uniformly random subtrees
- Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
- Random generation of colored trees
- A linear-time algorithm for the generation of trees
This page was built for publication: Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140121)
