Reduction from Nondecreasing Triangle to Triangle in Unweighted Graph
Revision as of 11:55, 15 February 2023 by Admin (talk | contribs) (Created page with "FROM: Nondecreasing Triangle TO: Triangle in Unweighted Graph == Description == == Implications == if: to-time: $T(n)$ for unweighted graph<br/>then: from-time: $O(n^{3/2} \sqrt{T(O(n))})$ == 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 7.1")
FROM: Nondecreasing Triangle TO: Triangle in Unweighted Graph
Description
Implications
if: to-time: $T(n)$ for unweighted graph
then: from-time: $O(n^{3/2} \sqrt{T(O(n))})$
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 7.1