A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Loopless Generation of Multiset Permutations using a Constant Number of Variables by Prefix Shifts
[chapter]
2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Preserved Fulltext
This paper answers the following mathematical question: Can multiset permutations be ordered so that each permutation is a prefix shift of the previous permutation? Previously, the answer was known for the permutations of any set, and the permutations of any multiset whose corresponding set contains only two elements. This paper also answers the following algorithmic question: Can multiset permutations be generated by a loopless algorithm that uses sublinear additional storage? Previously, the
doi:10.1137/1.9781611973068.107
fatcat:v4ojap64kndldciakokkrkad34