Lowe’s Algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki

Revision as of 10: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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Lowe’s_Algorithm_(SCCs_Strongly_Connected_Components)&oldid=44586"