Renault’s Algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(p*(V+E)*\alpha(V, E))$

Space Complexity

$O(V)$ per processor words

((can be easily derived?))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2009

Reference

https://link-springer-com.ezproxy.canberra.edu.au/chapter/10.1007/978-3-642-45221-5_44