Note on Gray codes for permutation lists
From MaRDI portal
Recommendations
Cited in
(14)- Gray codes for non-crossing partitions and dissections of a convex polygon
- Gray codes for reflection groups
- Gray code for Cayley permutations
- A Gray code for the shelling types of the boundary of a hypercube
- Strings from linear recurrences and permutations: a gray code
- The greedy Gray code algorithm
- A Gray code for permutations of size 2d with d descents
- Gray code and loopless algorithm for the reflection group D_n
- Statistical estimates of the<tex>n</tex>-bit Gray codes by restricted random generation of permutations of 1 to<tex>2^n</tex>
- Combinatorial families that are exponentially far from being listable in Gray code sequence
- A Survey of Combinatorial Gray Codes
- A loopless implementation of a gray code for signed permutations
- Combinatorial generation via permutation languages. I: Fundamentals
- Gray code for permutations with a fixed number of cycles
This page was built for publication: Note on Gray codes for permutation lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928273)