The INDEGREE Algorithm (InDegree Analysis Link Analysis)
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (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")
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