Lowe’s Algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki
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