论文信息 - An O(1) Time Algorithm for Generating Multiset Permutations

An O(1) Time Algorithm for Generating Multiset Permutations

We design an algorithm that generates multiset permutations in O(1) time from permutation to permutations, using only data structures of arrays. The previous O(1) time algorithm used pointers, causing O(n) time to access an element in a permutation, where n is the size of permutations. The central idea in our algorithm is tree traversal. We associate permutations with the leaves of a tree. By traversing this tree, going up and down and making changes when necessary, we spend O(1) time from permutation to permutation. Permutations are generated in a one-dimensional array.

Tadao Takaoka | T. Takaoka

[1] Minimal Elements in an Integer Representing Algorithm , 1976 .

[2] T. C. Hu,et al. Generating Permutations with Nondistinct Items , 1976 .

[3] T. C. Hu,et al. Generating Permutations with Nondistinct Items , 1976 .

[4] Joan M. Lucas. The Rotation Graph of Binary Trees is Hamiltonian , 1987, J. Algorithms.

[5] James F. Korsh,et al. Generating Multiset Permutations in Constant Time , 1997, J. Algorithms.

[6] Timothy R. Walsh. Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time , 1998, J. Algorithms.

[7] David Zerling,et al. Generating binary trees using rotations , 1985, JACM.

[8] Dominique Roelants van Baronaigien. A Loopless Algorithm for Generating Binary Tree Sequences , 1991, Inf. Process. Lett..

[9] Vincent Vajnovszki,et al. On the Loopless Generation of Binary Tree Sequences , 1998, Inf. Process. Lett..

[10] Frank Ruskey,et al. Generating Permutations of a Bag by Interchanges , 1992, Inf. Process. Lett..

[11] Frank Ruskey,et al. Generating Binary Trees by Transpositions , 1988, SWAT.

[12] Tadao Takaoka. O(1) Time Algorithms for Combinatorial Generation by Tree Traversal , 1999, Comput. J..

[13] Carla Savage,et al. A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[14] A. Nijenhuis. Combinatorial algorithms , 1975 .