Richardson and Domingos (Link Analysis Link Analysis)
Jump to navigation
Jump to search
Time Complexity
$O(m n )$
Space Complexity
$O(nl)$ words
(See paper (noting that sum d_q can be as high as O(nl)))
Description
Query-dependent PageRank
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2002