A Survey of Combinatorial Gray Codes
From MaRDI portal
Publication:4376203
DOI10.1137/S0036144595295272zbMath1049.94513WikidataQ29029188 ScholiaQ29029188MaRDI QIDQ4376203
Publication date: 10 February 1998
Published in: SIAM Review (Search for Journal in Brave)
compositionspermutationsCayley graphsBoolean latticeset partitionsde Bruijn sequencesinteger partitionsacyclic orientationsHamilton cycleslinear extensionsvertex-transitive graphsnecklacesGray codesbinary stringscombinationsCatalan familiesrestricted growth functions
Related Items (only showing first 100 items - show all)
A heuristic approach for constructing symmetric Gray codes ⋮ A loopless algorithm for generating the permutations of a multiset ⋮ Hamiltonian paths with prescribed edges in hypercubes ⋮ Greedy flipping of pancakes and burnt pancakes ⋮ Synthesis of test sequences with a given switching activity ⋮ Efficient Computation of Middle Levels Gray Codes ⋮ Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking ⋮ DECOMPOSITION OF UNITARY MATRICES AND QUANTUM GATES ⋮ Perfect matchings extend to Hamilton cycles in hypercubes ⋮ On locally balanced gray codes ⋮ Extending perfect matchings to Gray codes with prescribed ends ⋮ Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests ⋮ A shift Gray code for fixed-content Łukasiewicz words ⋮ \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\) ⋮ Synthetic sequence design for signal location search ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ Token graphs ⋮ Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Recoloring graphs via tree decompositions ⋮ Flip-swap languages in binary reflected Gray code order ⋮ On combinatorial Gray codes with distance 3 ⋮ Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle ⋮ Matching graphs of Hypercubes and Complete Bipartite Graphs ⋮ Description of polygonal regions by polynomials of bounded degree ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Trimming and gluing Gray codes ⋮ The Takagi function: a survey ⋮ Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups ⋮ Unnamed Item ⋮ Gray coding cubic planar maps ⋮ On the central levels problem ⋮ Gray codes for noncrossing and nonnesting partitions of classical types ⋮ Amortized efficiency of generating planar paths in convex position ⋮ Gray codes with bounded weights ⋮ On distance Gray codes ⋮ Binary bubble languages and cool-lex order ⋮ Computational capabilities at the edge of chaos for one dimensional systems undergoing continuous transitions ⋮ Efficient generation of restricted growth words ⋮ Distribution of the sum-of-digits function of random integers: a survey ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ Integer representations towards efficient counting in the bit probe model ⋮ Path bundles on \(n\)-cubes ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ Hamiltonian cycles and symmetric chains in Boolean lattices. ⋮ Gray code enumeration of plane straight-line graphs ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ On the spectrum of Hamiltonian cycles in the \(n\)-cube ⋮ Hamiltonian laceability of hypercubes without isometric subgraphs ⋮ Cyclic sequences of \(k\)-subsets with distinct consecutive unions ⋮ Flips in planar graphs ⋮ Walks: A Beginner's Guide to Graphs and Matrices ⋮ Generalized Gray codes with prescribed ends ⋮ On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric ⋮ Linear time construction of a compressed Gray code ⋮ Reordering columns for smaller indexes ⋮ The rotation graph of \(k\)-ary trees is Hamiltonian ⋮ Gray codes for reflectable languages ⋮ Optimal electronic musical instruments ⋮ Test sequence construction using minimum information on the tested system ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ On the low Hamming weight discrete logarithm problem for nonadjacent representations ⋮ Disjoint Hamilton cycles in the star graph ⋮ Gray codes for signed involutions ⋮ On cardinalities of \(k\)-abelian equivalence classes ⋮ Long paths and cycles in hypercubes with faulty vertices ⋮ Generating all distributions of objects to bins ⋮ Algorithms for optimal replica placement under correlated failure in hierarchical failure domains ⋮ Rainbow Cycles in Flip Graphs ⋮ Generating binary trees by Glivenko classes on Tamari lattices ⋮ Proof of the middle levels conjecture ⋮ Maximum number of edges joining vertices on a cube ⋮ Hamiltonian threshold for strong products of graphs ⋮ Finding Lean Induced Cycles in Binary Hypercubes ⋮ Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems ⋮ On the \((n,t)\)-antipodal Gray codes ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes ⋮ Loopless Algorithms And SchrÖder Trees ⋮ Enumeration aspects of maximal cliques and bicliques ⋮ Gray codes for non-crossing partitions and dissections of a convex polygon ⋮ Gray codes and symmetric chains ⋮ Antipodal Gray codes ⋮ Existence of a maximum balanced matching in the hypercube ⋮ Matching graphs of hypercubes and complete bipartite graphs ⋮ Rethinking arithmetic for deep neural networks ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ Rainbow Cycles in Flip Graphs. ⋮ Generating Gray codes for weak orders in constant amortized time ⋮ A Survey of Data Structures in the Bitprobe Model ⋮ Combinatorial families that are exponentially far from being listable in Gray code sequence ⋮ Compact mixed-integer programming formulations in quadratic optimization ⋮ On a characterization of the standard Gray code by using the edge type on a hypercube ⋮ Sparse Kneser graphs are Hamiltonian ⋮ Gray cycles of maximum length related to \(k\)-character substitutions ⋮ FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
This page was built for publication: A Survey of Combinatorial Gray Codes
