Randomized HITS (Link Analysis Link Analysis)
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.ezproxy.canberra.edu.au/doi/pdf/10.1145/383952.384003