An o(1) time algorithm for generating multiset permutations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1741, Issue , 1999, Pages 237-246

  Takaoka, Tadao ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; TREES (MATHEMATICS);

MULTISET; MULTISET PERMUTATION; ONE-DIMENSIONAL ARRAYS; TIME ALGORITHMS; TREE TRAVERSAL;

ALGORITHMS;

EID: 84958034173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_25     Document Type: Conference Paper

References (15)

1. Hu, T.C. and B.N. Tien, Generating permutations with nondistinct items, Amer. Math. Monthly, 83 (1976) 193-196
2. Ko, C.W. and F. Ruskey, Generating permutations of a bag by interchanges, Info. Proc. Lett., 41 (1992) 263-269
3. Korsh, J. and S. Lipshutz, Generating multiset permutations in constant time, Jour. Algorithms, 25 (1997) 321-335
4. Lucas, J., The rotation graph of binary trees is Hamiltonian, Jour. Algorithms, 8 (1987) 503-535
5. Mikawa, K. and T. Takaoka, Generation of parenthesis strings by transpositions, Proc. the Computing: The Australasian Theory Symposium (CATS '97) (1997) 51-58
6. Nijenhuis, A. and H.S. Wilf, Combinatorial Mathematics, Academic Press (1975)
7. Proskurowski, A. and F. Ruskey, Generating binary trees by transpositions, Jour. Algorithms, 11 (1990) 68-84
8. Reingold, E.M., J. Nievergelt, and N. Deo, Combinatorial Algorithms, Prentice-Hall (1977)
9. Roelants van Baronaigien, D., A loopless algorithm for generating binary tree sequences, Info. Proc. Lett., 39 (1991) 189-194.
10. Ruskey, F. and D. Roelants van Baronaigien, Fast recursive algorithms for gene-rating combinatorial objects, Congr. Numer., 41 (1984) 53-62
11. Savage, C, A survey of combinatorial Gray codes, SIAM Review, 39 (1997) 605-629
12. Takaoka, T., O(1) Time Algorithms for combinatorial generation by tree traversal, Computer Journal (to appear)(1999)
13. Vajnovski, V., On the loopless generation of binary tree sequences, Info. Proc. Lett., 68 (1998) 113-117
14. Walsh, T.R., Generation of well-formed parenthesis strings in constant worst-case time, Jour. Algorithms, 29 (1998) 165-173
15. Zerling, D., Generating binary trees by rotations, JACM, 32 (1985) 694-701