Efficient linear-time ranking and unranking of derangements

DOI10.1016/j.ipl.2022.106288OpenAlexW4281689989WikidataQ114167073 ScholiaQ114167073MaRDI QIDQ2094363

Kenji Mikawa, Ken-ichi Tanaka

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106288

zbMATH Keywords

algorithmscombinatorial problemderangementlinear-timeunranking

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Unnamed Item

Uses Software

• hfloat

Cites Work

• Unnamed Item
• Unnamed Item
• Linear-time generation of uniform random derangements encoded in cycle notation
• Ranking and unranking permutations in linear time
• Gray code for derangements
• Efficient generation of random derangements with the expected distribution of cycle lengths
• Constant time generation of derangements
• Lexicographic ranking and unranking of derangements in cycle notation
• Matters Computational
• Generating Random Derangements

This page was built for publication: Efficient linear-time ranking and unranking of derangements