CH Algorithm (SCCs Strongly Connected Components): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:3711:37, 15 February 2023‎ Admin talk contribs‎ 423 bytes +423‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/CH_Algorithm_(SCCs_Strongly_Connected_Components)"