CH Algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki
Revision as of 11:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(VE)$ == Space Complexity == $O(V+E)$? words (Each vertex needs to keep track of one color; then we need to build recursive subgraphs) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2004 == Reference == https://research.vu.nl/en/publications/on-distributed-verification-and-verified-distribution")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(VE)$

Space Complexity

$O(V+E)$? words

(Each vertex needs to keep track of one color; then we need to build recursive subgraphs)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2004

Reference

https://research.vu.nl/en/publications/on-distributed-verification-and-verified-distribution

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