Achlioptas (Link Analysis Link Analysis)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(mn )$

Space Complexity

$O((n+l)$^{2})? words

(Computes a constant number of SVDs of O((n+l)^2)-sized matrices)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2001

Reference

https://homes.cs.washington.edu/~karlin/papers/web-search.pdf