Linear-Time Ranking of Permutations
From MaRDI portal
Publication:3527211
DOI10.1007/978-3-540-75520-3_18zbMath1151.68738OpenAlexW1526899947MaRDI QIDQ3527211
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_18
Related Items
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, The saga of minimum spanning trees, Unranking of small combinations from large sets, A fast algorithm for order-preserving pattern matching, Fast Order-Preserving Pattern Matching, Ranking binary unlabelled necklaces in polynomial time