A general exhaustive generation algorithm for Gray structures

DOI10.1007/s00236-007-0053-0zbMath1127.68113arXivmath/0703262OpenAlexW1975955357MaRDI QIDQ995753

Elisabetta Grazzini, Renzo Pinzani, Elisa Pergola, Antonio Bernini

Publication date: 10 September 2007

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0703262

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items (7)

Avoiding cross-bifix-free binary words ⋮ Generalized algorithm for restricted weak composition generation ⋮ Efficient generation of restricted growth words ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ Mixed succession rules: the commutative case ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ Combinatorial generation via permutation languages. I. Fundamentals

Cites Work

• Unnamed Item
• Unnamed Item
• Pattern matching for permutations
• The number of Baxter permutations
• Random generation of trees and other combinatorial objects
• Some combinatorial interpretations of \(q\)-analogs of Schröder numbers
• Generating functions for generating trees
• Gray visiting Motzkins
• Gray code for derangements
• Exhaustive generation of combinatorial objects by ECO
• Generating trees and the Catalan and Schröder numbers
• Generating trees and forbidden subsequences
• On the equivalence problem for succession rules
• Generating binary trees by transpositions
• Efficient generation of the binary reflected gray code and its applications
• ECO:a methodology for the enumeration of combinatorial objects
• Generation of Permutations by Adjacent Transposition
• Approximating algebraic functions by means of rational ones

This page was built for publication: A general exhaustive generation algorithm for Gray structures