| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428114 | Information Processing Letters | 2009 | 4 Pages |
Abstract
We give two efficient algorithms for computing distances between partial rankings (i.e. rankings with ties). Given two partial rankings over n elements, and with b and c equivalence classes, respectively, our first algorithm runs in O(nlogn/loglogn) time, and the second in O(nlogmin{b,c}) time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
