On the hardness of Gray code problems for combinatorial objects

DOI10.1007/978-981-97-0566-5_9MaRDI QIDQ6575387zbMATH OpenFDO

Authors Arturo I. Merino, Kumari Namrata, Aaron Williams

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-981-97-0566-5_9

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Survey of Combinatorial Gray Codes
• All your bases are belong to us: listing all bases of a matroid by greedy exchanges
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Combinatorial generation via permutation languages. I: Fundamentals
• Combinatorial Gray codes for classes of pattern avoiding permutations
• Constant time and space updates for the sigma-tau problem
• Distance-2 Cyclic Chaining of Constant-Weight Codes
• Doubly adjacent gray codes for the symmetric group
• Generation of Permutations by Adjacent Transposition
• Gray codes with restricted density
• Hamilton Paths in Grid Graphs
• Hamiltonicity in (0-1)-polyhedra
• Kneser graphs are Hamiltonian
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• More restrictive Gray codes for some classes of pattern avoiding permutations
• On a combinatorial generation problem of Knuth
• On the central levels problem
• One hundred problems in elementary mathematics. With a foreword by Martin Gardner
• Proof of the middle levels conjecture
• Solving the Rubik's Cube Optimally is NP-complete
• Solving the sigma-tau problem
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The coolest way to generate binary strings
• The coolest way to generate combinations

Cited in

(1)

• Maximize the rightmost digit: Gray codes for restricted growth strings

This page was built for publication: On the hardness of Gray code problems for combinatorial objects

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