Lowe’s Algorithm (SCCs Strongly Connected Components)
Revision as of 11:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2})$ == Space Complexity == $O(V)$ per processor words ((can be easily derived?)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2014 == Reference == http://www.cs.ox.ac.uk/people/gavin.lowe/parallelDFS.html")
Time Complexity
$O(V^{2})$
Space Complexity
$O(V)$ per processor words
((can be easily derived?))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2014