A constant-time algorithm for middle levels Gray codes
From MaRDI portal
Publication:2309469
DOI10.1007/s00453-019-00640-2zbMath1433.94147OpenAlexW2982014679WikidataQ126984693 ScholiaQ126984693MaRDI QIDQ2309469
Jerri Nummenpalo, Torsten Mütze
Publication date: 1 April 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/142258/1/WRAP-constant-time-algorithm-middle-levels-Gray-codes-Mutze-2020.pdf
Related Items (5)
On a Combinatorial Generation Problem of Knuth ⋮ Star transposition Gray codes for multiset permutations ⋮ A numeral system for the middle-levels graphs ⋮ Gray codes and symmetric chains ⋮ Sparse Kneser graphs are Hamiltonian
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On generalized middle-level problem
- 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
- Lexicographic matchings cannot form Hamiltonian cycles
- Explicit matchings in the middle levels of the Boolean lattice
- Lexicographically least circular substrings
- An explicit 1-factorization in the middle of the Boolean lattice
- The antipodal layers problem
- Triangle-free Hamiltonian Kneser graphs
- Trimming and gluing Gray codes
- Monotone Gray codes and the middle levels problem
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
- The prism over the middle-levels graph is Hamiltonian
- Proof of the middle levels conjecture
- Some Hamilton Paths and a Minimal Change Algorithm
- Probabilistic combinatorics and the recent work of Peter Keevash
- Generating binary trees using rotations
- The rotation graph of binary trees is Hamiltonian
- A simplified loop-free algorithm for generating permutations
- 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
- Efficient Computation of Middle Levels Gray Codes
- A constant-time algorithm for middle levels Gray codes
- A short proof of the middle levels theorem
- Catalan Numbers
- Adjacent interchange generation of combinations
- Loopless Gray Code Enumeration and the Tower of Bucharest.
- On the Tree Graph of a Matroid
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Generation of Permutations by Adjacent Transposition
- Magical Mathematics
- Bipartite Kneser graphs are Hamiltonian
- A minimum-change version of the Chung-Feller theorem for Dyck paths
This page was built for publication: A constant-time algorithm for middle levels Gray codes
