Fleischer forward-backward (FB) 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.

10 April 2023

15 February 2023

  • curprev 10:3710:37, 15 February 2023‎ Admin talk contribs‎ 376 bytes +376‎ Created page with "== Time Complexity == $O(ElogV+V)$ == Space Complexity == $O(V+E)$ words (constructing recursive subgraphs? and reuse space across recursive calls) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://ldhulipala.github.io/readings/sequential-scc.pdf"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Fleischer_forward-backward_(FB)_algorithm_(SCCs_Strongly_Connected_Components)"