Note on Gray Codes for Permutation Lists
Publications de l'Institut Mathématique, _N_S_78 (2005) no. 92, p. 87
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
Robert Sedgewick [5] lists various Gray codes for the
permutations in $S_n$ including the classical algorithm by Johnson and
Trotter. Here we give an algorithm which constructs many families of
Gray codes for $S_n$, which closely follows the construction of the
Binary Reflexive Gray Code for the $n$-cube $Q_n$.
Classification :
94B60 68R05 20F65 05C38
Keywords: Algorithms, Combinatorial problems, Permutations, Gray codes
Keywords: Algorithms, Combinatorial problems, Permutations, Gray codes
@article{PIM_2005_N_S_78_92_a6,
author = {Seymour Lipschutz and Jie Gao and Dianjun Wang},
title = {Note on {Gray} {Codes} for {Permutation} {Lists}},
journal = {Publications de l'Institut Math\'ematique},
pages = {87 },
year = {2005},
volume = {_N_S_78},
number = {92},
language = {en},
url = {http://geodesic.mathdoc.fr/item/PIM_2005_N_S_78_92_a6/}
}
Seymour Lipschutz; Jie Gao; Dianjun Wang. Note on Gray Codes for Permutation Lists. Publications de l'Institut Mathématique, _N_S_78 (2005) no. 92, p. 87 . http://geodesic.mathdoc.fr/item/PIM_2005_N_S_78_92_a6/