Lexicographic ranking and unranking of derangements in cycle notation

Authors:
Kenji Mikawa;Ken Tanaka
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 6
Cited 0

Ranking and unranking permutations in linear time

Information Processing Letters
Constant time generation of derangements

Information Processing Letters
Gray code for derangements

Discrete Applied Mathematics
Generating derangements by interchanging at most four elements

Systems and Computers in Japan
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks

Wireless Networks
Enumerative Combinatorics: Volume 1

Enumerative Combinatorics: Volume 1

Quantified Score

Hi-index	0.04

Visualization

Abstract

We present lexicographic ranking and unranking algorithms for derangements expressed in cycle notation. These algorithms run in O(nlogn) time, require O(n) space, and use O(n) arithmetic operations. Similar algorithms that require less than or equal to O(nlogn) time with O(n) space complexity have not previously been proposed.