Fleischer forward-backward (FB) algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(E\log V+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/w/index.php?title=Fleischer_forward-backward_(FB)_algorithm_(SCCs_Strongly_Connected_Components)&oldid=47344"