A loopless algorithm for generating the permutations of a multiset

Authors:
Vincent Vajnovszki
Affiliations:
LE2I-CNRS FRE 2309, Université de Bourgogne, B.P. 47 870, Dijon 21078, Cedex, France
Venue:
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Year:
2003

Citing 11
Cited 11

Combinatorics for computer science

Combinatorics for computer science
Generating permutations of a bag by interchanges

Information Processing Letters
Generating multiset permutations in constant time

Journal of Algorithms
A Survey of Combinatorial Gray Codes

SIAM Review
Shuffle on trajectories: syntactic constraints

Theoretical Computer Science
On the loopless generation of binary tree sequences

Information Processing Letters
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Journal of the ACM (JACM)
Efficient generation of the binary reflected gray code and its applications

Communications of the ACM
Algorithm 383: permutations of a set with repetitions [G6]

Communications of the ACM
Algorithm 115: Perm

Communications of the ACM
Simple Combinatorial Gray Codes Constructed by Reversing Sublists

ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation

Gray code for derangements

Discrete Applied Mathematics
A loopless Gray code for rooted trees

ACM Transactions on Algorithms (TALG)
Combinatorial generation by fusing loopless algorithms

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words

Journal of Discrete Algorithms
Combinatorial Gray codes for classes of pattern avoiding permutations

Theoretical Computer Science
Loopless generation of multiset permutations using a constant number of variables by prefix shifts

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
More restrictive Gray codes for some classes of pattern avoiding permutations

Information Processing Letters
Loop-Free Gray Code Algorithms for the Set of Compositions

Journal of Mathematical Modelling and Algorithms
Loop-free Gray code algorithm for the e-restricted growth functions

Information Processing Letters
Binary bubble languages and cool-lex order

Journal of Combinatorial Theory Series A
Combinatorial generation by fusing loopless algorithms

CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shuffle on trajectories (defined previously in a non-combinatorial context), and we show how this constructor enables us to obtain a new loopless generating algorithm for multiset permutations from similar results for simpler objects.