The PAGERANK Algorithm (Link Analysis Link Analysis)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(m n )$

Space Complexity

$O(n)$ words

(Stores and updates an O(n)-sized vector designed to converge to some sort of stationary distribution)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1998

Reference

http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf