Reflection-free permutations, rosary permutations, and adjacent transposition algorithms
- 1 May 1973
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 16 (5) , 312-313
- https://doi.org/10.1145/362041.362225
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- A note on the generation of rosary permutationsCommunications of the ACM, 1972
- Generation of Rosary permutations expressed in Hamiltonian circuitsCommunications of the ACM, 1971
- Generation of permutation sequences: part 1The Computer Journal, 1970
- Generation of permutations by adjacent transpositionMathematics of Computation, 1963
- Algorithm 115: PermCommunications of the ACM, 1962