Combinatorial Gray Codes
From MaRDI portal
Publication:3898504
DOI10.1137/0209013zbMath0452.05009OpenAlexW2070058051MaRDI 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
recursionlinear orderscombinatorial objectscombinatorial Gray codesloop free algorithmsuniformly bounded transition algorithms
Related Items
Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes, A loop-free algorithm for generating the linear extensions of a poset, Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions, Weak-order extensions of an order., Gray codes in graphs of subsets, Restricted compositions and permutations: from old to new Gray codes, On the maximum disjoint paths problem on edge-colored graphs, Combinatorial isomorphism between Fibonacci classes, Prefix partitioned Gray codes for particular cross-bifix-free sets, Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity, Gray code orders for \(q\)-ary words avoiding a given factor, Unnamed Item, Gray codes for reflection groups, Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order, Variable-length codes independent or closed with respect to edit relations, Gray-Codes, Gray cycles of maximum length related to \(k\)-character substitutions, Gray codes from antimatroids