EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHEMATIQUE (BEOGRAD) (N.S.)
Vol. 78(92), pp. 87–92 (2005)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

Pick a mirror

 		 

NOTE ON GRAY CODES FOR PERMUTATION LISTS

Seymour Lipschutz, Jie Gao and Dianjun Wang

Department of Mathematics, Temple University, Philadelphia, PA 1912, USA; School of Software, Tsinghua University, Beijing 100084, China; Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China

Abstract: 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$.

Keywords: Algorithms; Combinatorial problems; Permutations; Gray codes

Classification (MSC2000): 94B60; 68R05; 20F65; 05C38

Full text of the article: (for faster download, first choose a mirror)

Electronic fulltext finalized on: 2 Mar 2006. This page was last modified: 27 Oct 2006.

© 2006 Mathematical Institute of the Serbian Academy of Science and Arts
© 2006 ELibM and FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition