OBF Algorithm (SCCs Strongly Connected Components)

From Algorithm Wiki
Revision as of 11:37, 15 February 2023 by Admin (talk | contribs) (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/document/8133154")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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/document/8133154

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=OBF_Algorithm_(SCCs_Strongly_Connected_Components)&oldid=44590"