Paul Purdom (Transitive Closure Strongly Connected Components)
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