An O(1) Time Algorithm for Generating Multiset Permutations

Authors:
Tadao Takaoka
Affiliations:
-
Venue:
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Year:
1999

Citing 10
Cited 2

The rotation graph of binary trees is hamiltonian

Journal of Algorithms
Generating binary trees by transpositions

Journal of Algorithms
A loopless algorithm for generating binary tree sequences

Information Processing Letters
Generating permutations of a bag by interchanges

Information Processing Letters
Generating binary trees using rotations

Journal of the ACM (JACM)
Generating multiset permutations in constant time

Journal of Algorithms
A Survey of Combinatorial Gray Codes

SIAM Review
On the loopless generation of binary tree sequences

Information Processing Letters
Generation of well-formed parenthesis strings in constant worst-case time

Journal of Algorithms
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

Loop-Free Gray Code Algorithms for the Set of Compositions

Journal of Mathematical Modelling and Algorithms
Binary bubble languages and cool-lex order

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.