Reduction from Minimum Triangle to Second Shortest Simple Path: 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.

    15 February 2023

    • curprev 10:5510:55, 15 February 2023‎ Admin talk contribs‎ 479 bytes +479‎ Created page with "FROM: Minimum Triangle TO: Second Shortest Simple Path == Description == == Implications == if: to-time: $T(n,W)$ where there are $n$ nodes and integer weights in $({0}, W)$<br/>then: from-time: $T(O(n), O(nW))$ for $n$ node graph with integer weights in $(-W, W)$ == Year == 2018 == Reference == V. V. Williams, R. R. Williams, Subcubic Equivalences Between Path, Matrix, and Triangle Problems. 2018. https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/3186893, Theorem..."
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Reduction_from_Minimum_Triangle_to_Second_Shortest_Simple_Path"