Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ESA
2007
Springer

favoriteEmaildiscussreport

99views Algorithms» more ESA 2007»

Linear-Time Ranking of Permutations

13 years 10 months ago

Linear-Time Ranking of Permutations

Download iti.mff.cuni.cz

Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutations. This is frequently used for indexing data structures by permutations. We present algorithms for computing both the ranking function and its inverse using O(n) arithmetic operations.

Martin Mares, Milan Straka

Real-time Traffic

ESA 2007 | Lexicographic Order | Lexicographic Ranking Function | Symbols Translates Permutations |

claim paper

Related Content

» How to Achieve an Equivalent Simple Permutation in Linear Time

» Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

» Linear structure of bipartite permutation graphs and the longest path problem

» A Simple LinearTime Modular Decomposition Algorithm for Graphs Using Order Extension

» Edge Search Number of Cographs in Linear Time

» Extracting Synchronous Grammar Rules From WordLevel Alignments in Linear Time

» Reversal Distance for Strings with Duplicates Linear Time Approximation using Hitting Set

» Perturbation based Large Margin Approach for Ranking

» FixedParameter Algorithms for Kemeny Scores

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	ESA
Authors	Martin Mares, Milan Straka

Comments (0)