Randomized HITS (Link Analysis Link Analysis)

From Algorithm Wiki
Revision as of 08:49, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(m n\log n )$

Space Complexity

$O(n)$ words

(Stores and updates hub and authority values per node)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2001

Reference

https://dl.acm.org/doi/pdf/10.1145/383952.384003