Balanced Gray codes
From MaRDI portal
Publication:1379168
zbMath0917.94019MaRDI QIDQ1379168
Girish S. Bhat, Carla D. Savage
Publication date: 22 February 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119846
Related Items (13)
Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes ⋮ Synthetic sequence design for signal location search ⋮ Amortized efficiency of generating planar paths in convex position ⋮ Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations ⋮ On the spectrum of Hamiltonian cycles in the \(n\)-cube ⋮ A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games ⋮ Rainbow Cycles in Flip Graphs ⋮ On flips in planar matchings ⋮ Existence of a maximum balanced matching in the hypercube ⋮ Rainbow Cycles in Flip Graphs. ⋮ Some classes of bipartite graphs induced by Gray codes ⋮ Fair Hamilton decompositions of complete multipartite graphs ⋮ Cyclic arrangements with minimum modulo \(m\) winding numbers
This page was built for publication: Balanced Gray codes
