OBF 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 10:3710:37, 15 February 2023‎ Admin talk contribs‎ 364 bytes +364‎ Created page with "== Time Complexity == $O(V(V+E))$ == Space Complexity == $O(E+V^{2})$ total words (https://ris.utwente.nl/ws/files/6872352/Barnat09distributed.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2011 == Reference == https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/8133154"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/OBF_Algorithm_(SCCs_Strongly_Connected_Components)"