Geldenhuys-Valmari (SCCs Strongly Connected Components)

From Algorithm Wiki
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V+E)$ == Space Complexity == $O(V)$? words ((follow-up from Tarjan's algorithm)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2004 == Reference == https://www.semanticscholar.org/paper/Depth-First-Search-and-Linear-Graph-Algorithms-Tarjan/385742fffcf113656f0d3cf6c06ef95cb8439dc6")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V+E)$

Space Complexity

$O(V)$? words

((follow-up from Tarjan's algorithm))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2004

Reference

https://www.semanticscholar.org/paper/Depth-First-Search-and-Linear-Graph-Algorithms-Tarjan/385742fffcf113656f0d3cf6c06ef95cb8439dc6

Retrieved from "https://algorithm-wiki.org/w/index.php?title=Geldenhuys-Valmari_(SCCs_Strongly_Connected_Components)&oldid=45072"