Gray code for derangements

Discrete Applied Mathematics

Volumn 140, Issue 1-3, 2004, Pages 207-221

  Baril, Jean Luc ^a   Vajnovszki, Vincent ^a  

^a UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

Generating algorithms; Gray codes; Restricted permutations

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; SET THEORY;

GENERATING ALGORITHMS; GRAY CODES; RESTRICTED PERMUTATIONS;

CODES (SYMBOLS);

EID: 2642579221     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.06.002     Document Type: Article

References (18)

1. Akl S.G. A new algorithm for generating derangements. BIT. 20:1980;2-7.
2. Akl S.G. The Design and Analysis of Parallel Algorithms. 1989;Prentice-Hall, Englewood Cliffs, NJ.
3. Chase P.J. Combination generation and graylex ordering. Congr. Numer. 69:1989;215-242.
4. Comtet L. Advanced Combinatorics: The Art of Finite and Infinite Expansions. 1974;Reidel, Dordrecht, Holland.
5. Eades P., McKay B. An algorithm for generating subsets of fixed size with a strong minimal change property. IPL. 19:1984;131-133.
6. Effler S., Ruskey F. A CAT algorithm for generating permutations with a fixed number of inversions. Inform. Process. Lett. 86(2):2003;107-112.
7. D.E. Knuth, The Art of Computer Programming, Combinatorial Algorithms, Vol. 4. Pre-fascicle 2b (Generating all permutations), http://www-cs-staff. Stanford.EDU/knuth/taocp.html #vol4,2002 .
8. Ko C.W., Ruskey F. Generating permutations of a bag by interchanges. IPL. 41(5):1992;263-269.
9. Korsh J.F. Loopless generation of up-down permutations. Discrete Math. 240(1-3):2001;97-122.
10. J. Korsh, P.S. LaFollette, Constant time generation of derangements, Department Technical Report, Temple University CIS, December 2002.
11. Roelants van Baronaigien D., Ruskey F. Generating permutations with given ups and downs. Discrete Appl. Math. 36(1):1992;57-65.
12. F. Ruskey, Simple combinatorial Gray codes constructed by reversing sublists in ISAAC Conference, Lecture Notes in Computer Science, Vol. 762, Springer, Berlin, 1993, pp. 201-208.
13. Sedgewick R. Permutation generation methods. Comput. Surveys. 9(2):1977;137-164.
14. R. Stanley, Enumerative Combinatorics, Vol. 1, Cambridge University Press, Cambridge, England, 1997.
15. Vajnovszki V. Gray visiting Motzkins. Acta Inform. 38:2002;793-811.
16. V. Vajnovszki, A loopless algorithm for generating the permutations of a multiset, TCS, 307 (2003) 415-431.
17. Walsh T. Loop-free sequencing of bounded integer compositions. J. Combin. Math. Combin. Comput. 33:2000;323-345.
18. Walsh T. Gray codes for involutions. J. Combin. Math. Combin. Comput. 36:2001;95-118.