Reduction from Negative Triangle Detection to Shortest Cycle
Revision as of 11:55, 15 February 2023 by Admin (talk | contribs) (Created page with "FROM: Negative Triangle Detection TO: Shortest Cycle == Description == == Implications == if: to-time: $T(n,M)$ where there are $n$ nodes and weights in $({1}, M)$<br/>then: from-time: $T(n, O(M))$ where there are $n$ nodes and weights in $(-M, M)$ == 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 5.3")
FROM: Negative Triangle Detection TO: Shortest Cycle
Description
Implications
if: to-time: $T(n,M)$ where there are $n$ nodes and weights in $({1}, M)$
then: from-time: $T(n, O(M))$ where there are $n$ nodes and weights in $(-M, M)$
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 5.3