Affiliation:
1. State University of New York at Stony Brook, New York, USA
Abstract
Abstract
We present two simple, intuitive and general algorithmic frameworks that can be used to design a wide variety of permutation generation algorithms. The frameworks can be used to produce 19 existing permutation algorithms, including the well-known algorithms of Heap, Wells, Langdon, Zaks, Tompkins and Lipski. We use the frameworks to design two new sorting-based permutation generation algorithms, one of which is optimal.
Funder
National Science Foundation
Publisher
Oxford University Press (OUP)
Reference36 articles.
1. Permutation generation methods;Sedgewick;ACM Computing Surveys,1977
2. Loopless generation of multiset permutations using a constant number of variables by prefix shifts;Williams;Proc. Symposium on Discrete Algorithms,2009
3. Generation of permutations by transposition;Wells;Mathematics of Computation,1961
4. Permutations by interchanges;Heap;The Computer Journal,1963
5. Permutation enumeration: four new permutation algorithms;Ives;Communications of the ACM,1976
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献