Back to papers

Efficient Partial-Pairs SimRank Search on Large Networks

Summary: Proposes a seed-germination model to compute partial-pairs SimRank s(a,b) for A×B in O(k|E| min{|A|,|B|}) time and O(|E|+k|V|) memory. Also reduces unnecessary edge accesses to O(m min{|A|,|B|}) time with m ≤ min{k|E|, Delta^(2k)}, enabling scalable partial-pairs similarity joins. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID

11169

Venue

VLDB

Year

2015

Pagerank

7.9744337e-05

Overall Rank

2,875 | 80.03%

DOI

-