Efficient enumeration of cyclic permutations in situ

References

• Aki , S. G. 1987 . Adaptive and optimal parallel algorithms for enumerating permutations and combinations . The Computer Journal , 30 : 433 – 436 .
   Google Scholar
• Chen , G. H. and Chern , M. S. 1986 . Parallel generation of permutations and combinations . BIT 26 , 26 : 277 – 283 .
   Web of Science ®Google Scholar
• Er , M. C . 1987 . An efficient implementation of permutation backtracking in lexicographic order . The Computer Journal , 30 ( No. 3 ) : 282 – 282 .
   Web of Science ®Google Scholar
• Er , M. C. 1987 . Lexicographic enumeration, ranking and unranking of permutations of r out of n objects . International Journal of Computer Mathematics , 23 ( No. 1 ) : 1 – 8 .
   Web of Science ®Google Scholar
• Gupta , P. and Bhattacharjee , G. P. 1983 . Parallel generation of permutations . The Computer Journal , 26 ( No. 1 ) : 97 – 105 .
   Google Scholar
• Hofri , M. 1987 . Probabilistic Analysis of Algorithms , New York : Springer-Verlag .
   Google Scholar
• Irving , R. W. 1984 . Permutation backtracking in lexicographic order . The Computer Journal , 27 ( No. 4 ) : 373 – 375 .
   Web of Science ®Google Scholar
• Nassimi , D. and Sahni , S. 1982 . Parallel permutation and sorting algorithms and a new generalized connection network . Journal of the ACM , 29 ( No. 4 ) : 642 – 667 .
   Google Scholar
• Nijenhuis , A. and Wilf , H. S. 1978 . Combinatorial Algorithms for Computers and Calculators , New York : Academic Press .
   Google Scholar
• Reingold , E. M. , Nievergelt , J. and Deo , N. 1977 . Combinatorial Algorithms: Theory and Practice , Englewood Cliffs, New Jersey : Prentice-Hall .
   Google Scholar
• Sedgewick , R. 1977 . Permutation generation methods . ACM Computing Surveys , 9 : 137 – 164 .
   Web of Science ®Google Scholar
• Zaks , S. 1984 . A new algorithm for generation of permutations . BIT , 24 : 196 – 204 .
   Google Scholar