A loopless algorithm for generating the permutations of a multiset

Theoretical Computer Science

Volumn 307, Issue 2, 2003, Pages 415-431

  Vajnovszki, Vincent ^a  

^a UNIVERSITÉ DE BOURGOGNE   (France)

Author keywords

Gray codes; Loopless generating algorithms; Multiset permutations; Shuffle combinatorial objects

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; TRAJECTORIES;

GRAY CODES;

COMPUTER SCIENCE;

EID: 0141525074     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00228-7     Document Type: Conference Paper

References (20)

1. Bitner J.R., Ehrlich G., Reingold E.M. Efficient generation of the binary reflected Gray code and its applications. Comm. ACM. 19(9):1976;517-521.
2. Canfield E.R., Williamson S.G. A loop-free algorithm for generating linear extensions of a poset. Order. 12:1995;57-75.
3. Chase P.J. Algorithm 383. Comm. ACM. 13:1970;368-370.
4. Eades G., McKay B. An algorithm for generating subsets of fixed size with a strong minimal change property. Inform. Process. Lett. 19:1984;131-133.
5. Ehrlich G. Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. J. Assoc. Comput. Mach. 20:1973;500-513.
6. Er M.C. On generating the n-ary reflected Gray codes. IEEE Trans. Comput. 33(8):1984;739-741.
7. Ko C.W., Ruskey F. Generating permutations of a bag by interchanges. Inform. Process. Lett. 41(5):1992;263-269.
8. Korsh J.F., Lipschutz S. Generating multiset permutations in constant time. J. Algorithms. 25:1997;321-335.
9. E. Lucas, Théorie de nombres, Gauthier-Villard, Paris, 1891 (repr. Blanchard, 1961).
10. Mateescu A., Rozenberg G., Salomaa A. Shuffle on trajectories. syntactic constraints Theoret. Comput. Sci. 197(1-2):1998;1-56.
11. F. Ruskey, Simple combinatorial Gray codes constructed by reversing sublists, in: ISAAC Conf., Lecture Notes in Computer Science, Vol. 762, 1993, pp. 201-208.
12. F. Ruskey, Combinatorial Object Server, http://www.theory.cs.uvic.ca/̃cos/cos.html.
13. F. Ruskey, Combinatorial Generation, book under preparation.
14. Savage C. A survey of combinatorial Gray codes. SIAM Rev. 39(4):1997;605-629.
15. T. Takaoka, An O(1) time algorithm for generating multiset permutations, Issac 99, Lecture Notes in Computer Science, Vol. 1741, 1999, pp. 237-246.
16. Trotter H.F. Perm (Algorithm 115). Comm. ACM. 5(8):1962;434-435.
17. Vajnovszki V. On the Loopless Generation of Binary Tree Sequences. Inform. Process. Lett. 68:1998;113-117.
18. Walsh T.R. Loop-free sequencing of bounded integer compositions. J. Combin. Math. Combin. Comput. 33:2000;323-345.
19. Walsh T.R. Gray codes for involutions. J. Combin. Math. Combin. Comput. 36:2001;95-118.
20. Williamson S.G. Combinatorics for Computer Science. 1985;Computer Science Press, Rockville, MA.