Fleischer forward-backward (FB) algorithm (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(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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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/w/index.php?title=Fleischer_forward-backward_(FB)_algorithm_(SCCs_Strongly_Connected_Components)&oldid=44582"