Aho, Garey & Ullman (Transitive Reduction Problem of Directed Graphs Transitive Reduction Problem)

From Algorithm Wiki

Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Aho,_Garey_%26_Ullman_(Transitive_Reduction_Problem_of_Directed_Graphs_Transitive_Reduction_Problem)&oldid=45530"