Trimming and gluing Gray codes

DOI10.4230/LIPICS.STACS.2017.40zbMATH Open1402.05201MaRDI QIDQ4636639FDOQ4636639

Authors: Petr Gregor, Torsten Mütze 

Publication date: 19 April 2018

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

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)

Cited In (4)

• Enumerating submultisets of multisets
• Star transposition Gray codes for multiset permutations
• Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity
• Trimming and gluing Gray codes

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)