Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tag: Reverted |
No edit summary Tag: Manual revert |
(24 intermediate revisions by the same user not shown) | |
(No difference)
|
Latest revision as of 12:22, 3 May 2023
Time Complexity
$O(n^{2.371})$
Space Complexity
$O(n^{2})$ words
(see (boolean) matrix multiplication)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2014