论文信息 - Note on Gray codes for permutation lists

Note on Gray codes for permutation lists

Robert Sedgewick [5] lists various Gray codes for the permutations in Sn including the classical algorithm by Johnson and Trotter. Here we give an algorithm which constructs many families of Gray codes for Sn, which closely follows the construction of the Binary Reflexive Gray Code for the n-cube Qn.

Wang Dianjun | Seymour Lipschutz | Jie Gao

[1] N. J. A. Sloane,et al. Gray codes for reflection groups , 1989, Graphs Comb..

[2] Jie Gao,et al. Permutation Generation: Two New Permutation Algorithms , 2003, ArXiv.

[3] Herbert S. Wilf,et al. Combinatorial Algorithms: An Update , 1987 .

[4] E. Gilbert. Gray codes and paths on the N-cube , 1958 .

[5] Robert Sedgewick,et al. Permutation Generation Methods , 1977, CSUR.

[6] Selmer M. Johnson. Generation of permutations by adjacent transposition , 1963 .