Random generation of trees and other combinatorial objects
From MaRDI portal
Publication:1292293
DOI10.1016/S0304-3975(98)00322-3zbMath0916.68124MaRDI QIDQ1292293
Elena Barcucci, Elisa Pergola, Alberto del Lungo
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Mixed succession rules: the commutative case, A general exhaustive generation algorithm for Gray structures, The relevant prefixes of coloured Motzkin walks: an average case analysis, Production matrices, From object grammars to ECO systems, On the equivalence problem for succession rules, Efficient iteration in admissible combinatorial classes
Cites Work
- Unnamed Item
- Generating binary trees with uniform probability
- A method and two algorithms on the theory of partitions
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
- Enumerating \(k\)-way trees
- A calculus for the random generation of labelled combinatorial structures
- Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
- A methodology for plane tree enumeration
- Uniform Random Generation of Strings in a Context-Free Language
- Random generation of colored trees
- Some permutations with forbidden subsequences and their inversion number