Trimming and gluing Gray codes

DOI10.4230/LIPICS.STACS.2017.40MaRDI QIDQ4636639zbMATHFDO

Authors Petr Gregor, Torsten Mütze

Publication date 19 April 2018

zbMATH Keywords

combinationGray codeloopless algorithmsubset

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Enumeration in graph theory (05C30) Combinatorial codes (94B25)

Recommendations

• Trimming and gluing Gray codes
• A constant-time algorithm for middle levels Gray codes
• A constant-time algorithm for middle levels Gray codes
• Efficient Computation of Middle Levels Gray Codes
• Monotone Gray codes and the middle levels problem

Cited in

(9)

• Star transposition Gray codes for multiset permutations
• A constant-time algorithm for middle levels Gray codes
• On a combinatorial generation problem of Knuth
• Trimming and gluing Gray codes
• Enumerating submultisets of multisets
• Gray codes and symmetric chains
• Gray codes and symmetric chains
• A constant-time algorithm for middle levels Gray codes
• Space-optimal quasi-Gray codes with logarithmic read complexity

This page was built for publication: Trimming and gluing Gray codes

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