Ranking and unranking permutations in linear time
From MaRDI portal
Publication:1603397
DOI10.1016/S0020-0190(01)00141-7zbMath1032.68670MaRDI QIDQ1603397
Frank Ruskey, Wendy J. Myrvold
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (18)
Lexicographic ranking and unranking of derangements in cycle notation ⋮ Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Cool-lex order and \(k\)-ary Catalan structures ⋮ A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem ⋮ Ranking and unranking bordered and unbordered words ⋮ Successor rules for flipping pancakes and burnt pancakes ⋮ Unnamed Item ⋮ Unranking of small combinations from large sets ⋮ Random and exhaustive generation of permutations and cycles ⋮ Translation Techniques for Reversible Circuit Synthesis with Positive and Negative Controls ⋮ Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem ⋮ Closure and nonclosure properties of the classes of compressible and rankable sets ⋮ Syntactic view of sigma-tau generation of permutations ⋮ A Groupoid of Isomorphic Data Transformations ⋮ An Audit Tool for Genome Rearrangement Algorithms ⋮ Efficient linear-time ranking and unranking of derangements ⋮ Fast Order-Preserving Pattern Matching ⋮ Ranking binary unlabelled necklaces in polynomial time
Cites Work
This page was built for publication: Ranking and unranking permutations in linear time
