Permutation Generation Methods
@article{Sedgewick1977PermutationGM,
title={Permutation Generation Methods},
author={R. Sedgewick},
journal={ACM Comput. Surv.},
year={1977},
volume={9},
pages={137-164}
}This paper surveys the numerous methods tha t have been proposed for pe rmuta tmn enumera t ion by computer. The various algori thms which have been developed over the years are described in detail, and zmplemented in a modern ALc, oL-hke language. All of the algori thms are derived from one rumple control structure. The problems involved with implement ing the best of the algori thms on real computers are t reated m detail. Assembly-language programs are derived and analyzed fully. The paper… Expand
Figures, Tables, and Topics from this paper
248 Citations
Fast algorithms for genegrating integer partitions
- Mathematics, Computer Science
- Int. J. Comput. Math.
- 1998
- 76
A Versatile Algorithm to Generate Various Combinatorial Structures
- Computer Science, Mathematics
- ArXiv
- 2010
- PDF
Generating words lexicographically: An average-case analysis
- Mathematics, Computer Science
- Acta Informatica
- 1998
- 16
A Cost-Optimal Pipeline Algorithm for Permutation Generation in Lexicographic Order
- Computer Science
- J. Parallel Distributed Comput.
- 1997
- 10
Parallel permutation generation on linear array
- Mathematics, Computer Science
- Int. J. Comput. Math.
- 1991
- 6
References
SHOWING 1-4 OF 4 REFERENCES
Permutahon (Algorithm 71)
- Comm. A C M 4, 11 (Nov 1961), 497.
- 1961
A dzsc~pllne of programm~ng, Prentice-Hall, Englewood Cliffs
- N J ,,
- 1976
AND SCHRACK, G F "Permute (Algorithm 86),
- Comm. ACM 5,
- 1962
Machine attacks on problems whoso variables are permutations
- Proc Symposium zn Appl. Math., Numerwal Analysts, Vol 6, McGraw-Hill, Inc., N.Y., 1956, 195-211
- 1956