Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^omega)$ where omega is the exponent on boolean matrix multiplication == Space Complexity == $O(n^{2})$ words (see (boolean) matrix multiplication) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1972 == Reference == https://epubs.siam.org/doi/pdf/10.1137/0201008") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^ | $O(n^{2.8})$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
1978 | |||
== Reference == | == Reference == | ||
https://epubs.siam.org/doi/pdf/10.1137/0201008 | https://epubs.siam.org/doi/pdf/10.1137/0201008 | ||
Revision as of 12:17, 15 February 2023
Time Complexity
$O(n^{2.8})$
Space Complexity
$O(n^{2})$ words
(see (boolean) matrix multiplication)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1978