A Survey of Combinatorial Gray Codes
From MaRDI portal
Publication:4376203
Recommendations
- A Gray code for combinations of a multiset
- Note on Gray codes for permutation lists
- Combinatorial families that are exponentially far from being listable in Gray code sequence
- Restricted compositions and permutations: from old to new Gray codes
- More restrictive Gray codes for some classes of pattern avoiding permutations
Cited in
(only showing first 100 items - show all)- A Gray code of ordered trees
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
- Amortized efficiency of generating planar paths in convex position
- \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\)
- Matchings in hypercubes extend to long cycles
- On distance Gray codes
- Gray codes and symmetric chains
- Gray codes and symmetric chains
- Efficient generation of restricted growth words
- Dynamical decoupling schemes derived from Hamilton cycles
- Hamiltonian cycles and symmetric chains in Boolean lattices.
- Recoloring graphs via tree decompositions
- Fast enumeration algorithms for non-crossing geometric graphs
- Single-Track Gray Codes and Sequences
- Algorithms for optimal replica placement under correlated failure in hierarchical failure domains
- Generating Gray codes for weak orders in constant amortized time
- Compact mixed-integer programming formulations in quadratic optimization
- On a characterization of the standard Gray code by using the edge type on a hypercube
- Hamiltonian laceability of hypercubes without isometric subgraphs
- Trimming and gluing Gray codes
- Gray codes for reflectable languages
- The Takagi function: a survey
- Gray codes for non-crossing partitions and dissections of a convex polygon
- On the central levels problem
- scientific article; zbMATH DE number 4137767 (Why is no real title available?)
- Enumeration aspects of maximal cliques and bicliques
- Combinatorial generation via permutation languages. III: Rectangulations
- Generalized Gray codes with prescribed ends
- Path bundles on \(n\)-cubes
- A constant-time algorithm for middle levels Gray codes
- More restricted growth functions: Gray codes and exhaustive generation
- Synthetic sequence design for signal location search
- Combinatorial Gray codes for classes of pattern avoiding permutations
- Combinatorial Gray codes -- an updated survey
- Extending perfect matchings to Gray codes with prescribed ends
- Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups
- Perfect matchings extend to Hamilton cycles in hypercubes
- Matching graphs of Hypercubes and Complete Bipartite Graphs
- Flips in planar graphs
- Efficient algorithms on distributive lattices
- Walks: a beginner's guide to graphs and matrices
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
- Long paths and cycles in hypercubes with faulty vertices
- Gray cycles of maximum length related to \(k\)-character substitutions
- Constant time and space updates for the sigma-tau problem
- Generating signed permutations by twisting two-sided ribbons
- Combinatorial families that are exponentially far from being listable in Gray code sequence
- Computational capabilities at the edge of chaos for one dimensional systems undergoing continuous transitions
- On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
- Statistical estimates of the<tex>n</tex>-bit Gray codes by restricted random generation of permutations of 1 to<tex>2^n</tex>
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- Loopless Algorithms And SchrÖder Trees
- Loop-free Gray code algorithms for the set of compositions
- A loopless algorithm for generating the permutations of a multiset
- \(k\)-universality of regular languages
- Pattern-avoiding binary trees -- generation, counting, and bijections
- Variable-length codes independent or closed with respect to edit relations
- Kneser graphs are Hamiltonian
- Generating all distributions of objects to bins
- Decomposition of unitary matrices and quantum gates
- Space-optimal quasi-Gray codes with logarithmic read complexity
- Distribution of the sum-of-digits function of random integers: a survey
- Binary bubble languages and cool-lex order
- Gray code and loopless algorithm for the reflection group \(D_n\)
- scientific article; zbMATH DE number 7684688 (Why is no real title available?)
- Bipartite Kneser graphs are Hamiltonian
- On a combinatorial generation problem of Knuth
- Gray code enumeration of plane straight-line graphs
- Linear time construction of a compressed Gray code
- Some complementary Gray codes
- Flip-swap languages in binary reflected Gray code order
- Reordering columns for smaller indexes
- Matching graphs of hypercubes and complete bipartite graphs
- Integer representations towards efficient counting in the bit probe model
- Finding Lean Induced Cycles in Binary Hypercubes
- The rotation graph of \(k\)-ary trees is Hamiltonian
- Optimal electronic musical instruments
- Generating cyclic 2-Gray codes for Fibonacci \(q\)-decreasing words
- On the hardness of Gray code problems for combinatorial objects
- Maximum number of edges joining vertices on a cube
- A heuristic approach for constructing symmetric Gray codes
- Strong mixed-integer formulations for the floor layout problem
- Efficient Computation of Middle Levels Gray Codes
- A Survey of Data Structures in the Bitprobe Model
- Maximize the rightmost digit: Gray codes for restricted growth strings
- Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
- Hamiltonian threshold for strong products of graphs
- Distribution of distinguishable objects to bins: generating all distributions
- On the spectrum of Hamiltonian cycles in the \(n\)-cube
- Exhaustive generation of combinatorial objects by ECO
- Greedy Gray codes for Dyck words and ballot sequences
- Ranking and Unranking k-Subsequence Universal Words
- Gray codes for signed involutions
- Rethinking arithmetic for deep neural networks
- Greedy flipping of pancakes and burnt pancakes
- On the low Hamming weight discrete logarithm problem for nonadjacent representations
- Generating binary trees by Glivenko classes on Tamari lattices
This page was built for publication: A Survey of Combinatorial Gray Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376203)
