Efficient Computation of Middle Levels Gray Codes
From MaRDI portal
Publication:3452851
DOI10.1007/978-3-662-48350-3_76zbMath1414.94945arXiv1506.07898OpenAlexW1810143980MaRDI QIDQ3452851
Torsten Mütze, Jerri Nummenpalo
Publication date: 19 November 2015
Published in: Algorithms - ESA 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.07898
Related Items (4)
Efficient Computation of Middle Levels Gray Codes ⋮ Trimming and gluing Gray codes ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths
Cites Work
- Unnamed Item
- Unnamed Item
- Construction of 2-factors in the middle layer of the discrete cube
- Long cycles in the middle two layers of the discrete cube
- An update on the middle levels problem
- An algorithm for generating subsets of fixed size with a strong minimal change property
- Gray codes with restricted density
- Explicit matchings in the middle levels of the Boolean lattice
- An explicit 1-factorization in the middle of the Boolean lattice
- Monotone Gray codes and the middle levels problem
- Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
- The Chung-Feller theorem revisited
- Proof of the middle levels conjecture
- Efficient Computation of Middle Levels Gray Codes
- Efficient generation of the binary reflected gray code and its applications
- On Rotations and the Generation of Binary Trees
- A Survey of Combinatorial Gray Codes
- Adjacent interchange generation of combinations
- Generation of Permutations by Adjacent Transposition
This page was built for publication: Efficient Computation of Middle Levels Gray Codes
