On the hardness of Gray code problems for combinatorial objects
From MaRDI portal
Publication:6575387
DOI10.1007/978-981-97-0566-5_9MaRDI QIDQ6575387
Kumari Namrata, Arturo I. Merino, Aaron Williams
Publication date: 19 July 2024
Cites Work
- Unnamed Item
- Unnamed Item
- The coolest way to generate binary strings
- Hamiltonicity in (0-1)-polyhedra
- Combinatorial Gray codes for classes of pattern avoiding permutations
- More restrictive Gray codes for some classes of pattern avoiding permutations
- The coolest way to generate combinations
- An algorithm for generating subsets of fixed size with a strong minimal change property
- Gray codes with restricted density
- On the central levels problem
- Proof of the middle levels conjecture
- Solving the Rubik's Cube Optimally is NP-complete
- Doubly adjacent gray codes for the symmetric group
- A Survey of Combinatorial Gray Codes
- Hamilton Paths in Grid Graphs
- Solving the Sigma-Tau Problem
- On a Combinatorial Generation Problem of Knuth
- Distance-2 Cyclic Chaining of Constant-Weight Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Generation of Permutations by Adjacent Transposition
- Combinatorial generation via permutation languages. I. Fundamentals
- Kneser graphs are Hamiltonian
- All your bases are belong to us: listing all bases of a matroid by greedy exchanges
- Constant time and space updates for the sigma-tau problem
This page was built for publication: On the hardness of Gray code problems for combinatorial objects
