A new algorithm for generation of permutations
- 1 June 1984
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 24 (2) , 196-204
- https://doi.org/10.1007/bf01937486
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Bounds for sorting by prefix reversalDiscrete Mathematics, 1979
- Permutation Generation MethodsACM Computing Surveys, 1977
- E2571The American Mathematical Monthly, 1977
- E1030The American Mathematical Monthly, 1975
- A simplified loop-free algorithm for generating permutationsBIT Numerical Mathematics, 1975
- Algorithm 466: four combinatorial algorithm [G6]Communications of the ACM, 1973
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial ConfigurationsJournal of the ACM, 1973
- Generation of permutations by adjacent transpositionMathematics of Computation, 1963
- Algorithm 115: PermCommunications of the ACM, 1962