Random generation of trees and other combinatorial objects

DOI10.1016/S0304-3975(98)00322-3MaRDI QIDQ1292293zbMATH OpenOpenAlexFDO

Authors Elena Barcucci, E. Pergola, A. Del Lungo

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• A calculus for the random generation of labelled combinatorial structures
• A linear-time algorithm for the generation of trees
• The generation of random, binary unordered trees
• Generating random combinatorial objects

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)

• From object grammars to ECO systems
• scientific article; zbMATH DE number 1375603 (Why is no real title available?)
• Random combinatorial objects
• Efficient iteration in admissible combinatorial classes
• Production matrices
• The relevant prefixes of coloured Motzkin walks: an average case analysis
• The generation of random, binary unordered trees
• On the equivalence problem for succession rules
• Generating random combinatorial objects
• Random generation using binomial approximations
• Random generation of combinatorial structures from a uniform distribution
• Production matrices and riordan arrays
• Holonomic equations and efficient random generation of binary trees
• A linear algorithm for the random sampling from regular languages
• Mixed succession rules: the commutative case
• A general exhaustive generation algorithm for Gray structures
• Enumeration and randomized constructions of hypertrees

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)