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

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

3 May 2023

28 April 2023

10 April 2023

15 February 2023

  • curprev 12:1712:17, 15 February 2023‎ Admin talk contribs‎ 392 bytes +392‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Aho,_Garey_%26_Ullman_(Transitive_Reduction_Problem_of_Directed_Graphs_Transitive_Reduction_Problem)"