We present CoSimRank, a graph-theoretic similarity measure that is efficient because it can compute a single node similarity without having to compute the similarities of the entire graph.
we do not compare against this new measure as it uses the graph Laplacian and so cannot be computed for a single node pair.