Combinatorial generation via permutation languages

DOI10.1137/1.9781611975994.74OpenAlexW2997349279MaRDI QIDQ5146846

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

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)

Related Items (10)

Inside the binary reflected gray code: flip-swap languages in 2-gray code order ⋮ Flip-swap languages in binary reflected Gray code order ⋮ Fairer comparisons for travelling salesman problem solutions using hash functions ⋮ Combinatorial generation via permutation languages. III: Rectangulations ⋮ 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 ⋮ Syntactic view of sigma-tau generation of permutations ⋮ Combinatorial generation via permutation languages. II. Lattice congruences ⋮ Generating Gray codes for weak orders in constant amortized time ⋮ Combinatorial generation via permutation languages. I. Fundamentals

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