Constant time generation of derangements

Constant time generation of derangements

This paper presents the first constant time generation algorithm for derangements—permutations with no fixed points. Each derangement is obtained from its predecessor by making either one transposition or one rotation of three elements. It also generalizes this to permutations with a bounded number...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2004-05, Vol.90 (4), p.181-186
Hauptverfasser: Korsh, James F., LaFollette, Paul S.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Combinatorial problems
Computer programming
Computer science
control theory
systems
Derangements
Exact sciences and technology
Fixed points
Gray code
Loopless
Studies
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents the first constant time generation algorithm for derangements—permutations with no fixed points. Each derangement is obtained from its predecessor by making either one transposition or one rotation of three elements. It also generalizes this to permutations with a bounded number of fixed points.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2004.02.006