Andrei Broder, Ravi Kumar, et al.
Computer Networks
We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other. © 2006 Society for Industrial and Applied Mathematics.
Andrei Broder, Ravi Kumar, et al.
Computer Networks
Ronald Fagin
Discrete Mathematics
Ronald Fagin
Journal of the ACM
Ronald Fagin
ACM TODS