Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2.807})$
Space Complexity
$O(n^{2})$ words
(see (boolean) matrix multiplication)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1972