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

From Algorithm Wiki

Jump to navigation Jump to search

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

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=48038"