Exhaustive generation of combinatorial objects by ECO
From MaRDI portal
Recommendations
Cited in
(20)- Efficient oracles for generating binary bubble languages
- Efficient iteration in admissible combinatorial classes
- Binary bubble languages and cool-lex order
- An exhaustive generation algorithm for Catalan objects and others
- A general exhaustive generation algorithm for Gray structures
- Flip-swap languages in binary reflected Gray code order
- Production matrices
- Combinatorial generation via permutation languages. I: Fundamentals
- Avoiding cross-bifix-free binary words
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns
- From object grammars to ECO systems
- Enumeration of L-convex polyominoes by rows and columns
- Combinatorial generation: greedy approaches and symmetry
- On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
- Production matrices and riordan arrays
- Combinatorial Gray codes for classes of pattern avoiding permutations
- Generating restricted classes of involutions, Bell and Stirling permutations
- Generalized algorithm for restricted weak composition generation
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order
This page was built for publication: Exhaustive generation of combinatorial objects by ECO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889882)