Tomlin (Link Analysis Link Analysis)
Jump to navigation
Jump to search
Time Complexity
$O(m n )$
Space Complexity
$O(n)$? words
(Generally computes O(n) values per iteration (row + column sums and their ratios); algorithm can be smart about intermediate calculations as to not use more space asymptotically)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2003