Couvreur (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+E)$ == Space Complexity == $O(V)$? words (can be easily derived?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == https://link-springer-com.ezproxy.canberra.edu.au/chapter/10.1007/3-540-48119-2_16")

(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

(can be easily derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1999

Reference

https://link-springer-com.ezproxy.canberra.edu.au/chapter/10.1007/3-540-48119-2_16

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