Combinatorial generation via permutation languages

DOI10.1137/1.9781611975994.74MaRDI QIDQ5146846zbMATH OpenOpenAlexFDO

Authors Elizabeth J. Hartung, Hung P. Hoang, Torsten Mütze, Aaron Williams

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975994.74

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Combinatorial generation via permutation languages. I: Fundamentals
• Combinatorial generation via permutation languages. III: Rectangulations
• Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
• Combinatorial generation via permutation languages. II. Lattice congruences
• ON A HIERARCHY OF PERMUTATION LANGUAGES
• On permutative grammars generating context-free languages
• Counting and Generating Permutations Using Timed Languages
• Regular and linear permutation languages
• Combinators for program generation

Cited in

(18)

• Combinatorial generation via permutation languages. II. Lattice congruences
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order
• Generating all permutations by context-free grammars in Chomsky normal form
• Flip-swap languages in binary reflected Gray code order
• Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
• A pivot Gray code listing for the spanning trees of the fan graph
• Generative languages, codes and parallel processing
• ON A HIERARCHY OF PERMUTATION LANGUAGES
• Counting and Generating Permutations Using Timed Languages
• Combinatorial generation via permutation languages. I: Fundamentals
• Syntactic view of sigma-tau generation of permutations
• Fairer comparisons for travelling salesman problem solutions using hash functions
• Combinatorial generation via permutation languages. III: Rectangulations
• Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
• Pivot Gray codes for the spanning trees of a graph ft. the fan
• Combinatorial generation: greedy approaches and symmetry
• Efficient generation of rectangulations via permutation languages
• Generating Gray codes for weak orders in constant amortized time

This page was built for publication: Combinatorial generation via permutation languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146846)