Renault’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(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/chapter/10.1007/978-3-642-45221-5_44")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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/chapter/10.1007/978-3-642-45221-5_44

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Renault’s_Algorithm_(SCCs_Strongly_Connected_Components)&oldid=44587"