Paul Purdom (Transitive Closure Strongly Connected Components)

From Algorithm Wiki
Revision as of 10:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2}+VE)$ == Space Complexity == $O(V^{2})$ words (https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/BF01940892.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1970 == Reference == https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007%2FBF01940892")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V^{2}+VE)$

Space Complexity

$O(V^{2})$ words

(https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/BF01940892.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1970

Reference

https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007%2FBF01940892

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Paul_Purdom_(Transitive_Closure_Strongly_Connected_Components)&oldid=44585"