Random generation of trees and other combinatorial objects
From MaRDI portal
(Redirected from Publication:1292293)
Recommendations
Cites work
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- A calculus for the random generation of labelled combinatorial structures
- A method and two algorithms on the theory of partitions
- A methodology for plane tree enumeration
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
- Enumerating k-way trees
- Generating binary trees with uniform probability
- Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
- Random generation of colored trees
- Some permutations with forbidden subsequences and their inversion number
- Uniform Random Generation of Strings in a Context-Free Language
Cited in
(17)- Efficient iteration in admissible combinatorial classes
- Mixed succession rules: the commutative case
- Generating random combinatorial objects
- scientific article; zbMATH DE number 1375603 (Why is no real title available?)
- A general exhaustive generation algorithm for Gray structures
- Random generation of combinatorial structures from a uniform distribution
- Enumeration and randomized constructions of hypertrees
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- Production matrices
- On the equivalence problem for succession rules
- Holonomic equations and efficient random generation of binary trees
- Random combinatorial objects
- From object grammars to ECO systems
- Random generation using binomial approximations
- Production matrices and riordan arrays
- A linear algorithm for the random sampling from regular languages
- The generation of random, binary unordered trees
This page was built for publication: Random generation of trees and other combinatorial objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292293)