Random generation of trees and other combinatorial objects
From MaRDI portal
Publication:1292293
DOI10.1016/S0304-3975(98)00322-3zbMATH Open0916.68124OpenAlexW2008516236MaRDI QIDQ1292293FDOQ1292293
A. Del Lungo, Elena Barcucci, E. Pergola
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00322-3
Recommendations
Cites Work
- Title not available (Why is that?)
- A method and two algorithms on the theory of partitions
- Random generation of colored trees
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
- A calculus for the random generation of labelled combinatorial structures
- A methodology for plane tree enumeration
- Uniform Random Generation of Strings in a Context-Free Language
- Some permutations with forbidden subsequences and their inversion number
- Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
- Generating binary trees with uniform probability
- Enumerating \(k\)-way trees
Cited In (14)
- Efficient iteration in admissible combinatorial classes
- Generating random combinatorial objects
- Mixed succession rules: the commutative case
- A general exhaustive generation algorithm for Gray structures
- Random generation of combinatorial structures from a uniform distribution
- Enumeration and randomized constructions of hypertrees
- Production matrices
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- On the equivalence problem for succession rules
- Random combinatorial objects
- From object grammars to ECO systems
- 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)
