Loopless array generation of multiset permutations

Computer Journal

Volumn 47, Issue 5, 2004, Pages 612-621

  Korsh, James F ^a   LaFollette, Paul S ^a  

^a Temple University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; RECURSIVE FUNCTIONS; SET THEORY;

COMBINATORIAL OBJECTS; LOOPLESS ARRAY GENERATION; MULTISET PERMUTATIONS;

COMPUTATION THEORY;

EID: 4444295735     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/47.5.612     Document Type: Article

References (16)

1. Ehrlich, G. (1973) Loopless algorithms for generating permutations, combinations, and other combinatorial objects. J. ACM, 20, 500-513.
2. Korsh, J. and Lipschutz, S. (1997) Generating multiset permutations in constant time. J. Algorithms, 25, 321-335.
3. Takaoka, T. (1999) An O(1) time algorithm for generating multiset permutations. In Proc. 10th Int. Symp. on Algorithms and Computation (ISAAC'99), Chennai, India, December 16-18, LNCS 1741, pp. 237-246. Springer.
4. Canfield, E. R. and Williamson, S. G. (1995) A loop-free algorithm for generating the linear extensions of a poset. Order, 12, 57-75.
5. Korsh, J. F. and LaFollette, P. S. (2002) Loopless generation of linear extensions of a poset. Order, 19, 115-126.
6. Eades, P. and McKay, B. (1984) An algorithm for generating subsets of fixed size with a strong minimal change property. Inform. Process. Lett., 19, 131-133.
7. Korsh, J. F. and LaFollette, P. S. (2002) Loopless Array Generation of Multiset Permutations. Technical Report, Department of CIS, PA, USA.
8. Vajnovszki, V. (2003) A loopless algorithm for generating the permutations of a multiset. Theoret. Comput. Sci., 307, 415-431.
9. Johnson, S. M. (1963) The generation of permutations by adjacent transpositions. Math. Comput., 17, 282-285.
10. Trotter, H. F. (1962) PERM (Algorithm 115). Commun. ACM, 5(8), 434-435.
11. Lehmer, D. H. (1964) The machine tools of combinatorics. In Beckenbach, E. F. (ed.), Applied Combinatorial Mathematics, pp. 5-31. Wiley, New York.
12. Bitner, J. R., Ehrlich, G. and Reingold, E. M. (1976) Efficient generation of the binary reflected Gray code and its applications. Commun. ACM, 19, 517-521.
13. Ruskey, F. (1993) Simple combinatorial Gray codes constructed by reversing sublists. In Proc. 4th Int. Symp. on Algorithms and Computation (ISAAC), LNCS 762, pp. 201-208. Springer.
14. Xiang, L. and Ushijima, K. (2001) On O(1) time algorithms for combinatorial generation. Comp. J., 44, 292-302.
15. Walsh, T. R. (2001) Gray codes for involutions. J. Combinat. Math. Combinat. Comput., 36, 95-118.
16. Vajnovszki, V. (1998) On the loopless generation of binary tree sequences. Inform. Process. Lett., 68, 113-117.