Combinatorial Gray Codes
From MaRDI portal
Publication:3898504
DOI10.1137/0209013zbMath0452.05009MaRDI QIDQ3898504
Dennis E. White, J. T. Joichi, S. Gill Williamson
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209013
recursion; linear orders; combinatorial objects; combinatorial Gray codes; loop free algorithms; uniformly bounded transition algorithms
Related Items
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity, Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions, Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes, On the maximum disjoint paths problem on edge-colored graphs, Prefix partitioned Gray codes for particular cross-bifix-free sets, Gray code orders for \(q\)-ary words avoiding a given factor, Gray-Codes, Gray codes in graphs of subsets, Gray codes from antimatroids, Weak-order extensions of an order., Gray codes for reflection groups, A loop-free algorithm for generating the linear extensions of a poset, Restricted compositions and permutations: from old to new Gray codes, Variable-length codes independent or closed with respect to edit relations, Gray cycles of maximum length related to \(k\)-character substitutions, Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order, Combinatorial isomorphism between Fibonacci classes, Unnamed Item
