Lexicographic ranking and unranking of derangements in cycle notation
From MaRDI portal
Publication:2636806
DOI10.1016/j.dam.2013.10.001zbMath1283.05017MaRDI QIDQ2636806
Publication date: 18 February 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.001
Related Items
Linear-time generation of uniform random derangements encoded in cycle notation, Closure and nonclosure properties of the classes of compressible and rankable sets, Efficient linear-time ranking and unranking of derangements
Cites Work