The INDEGREE Algorithm (InDegree Analysis Link Analysis): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(m^{2} n )$ == Space Complexity == $O(n)$ words (Must maintain a list of visited nodes to eliminate duplication.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1997 == Reference == https://www.w3.org/People/Massimo/papers/quest_hypersearch.pdf") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(mn)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 09:49, 10 April 2023
Time Complexity
$O(mn)$
Space Complexity
$O(n)$ words
(Must maintain a list of visited nodes to eliminate duplication.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1997
Reference
https://www.w3.org/People/Massimo/papers/quest_hypersearch.pdf