Reduction from Minimum Witness Finding to Negative Triangle Detection

From Algorithm Wiki
Jump to navigation Jump to search

FROM: Minimum Witness Finding TO: Negative Triangle Detection

Description

Implications

if: to-time: $T(n)$ where $n$ is the number of nodes in the graph
then: from-time: $O(T(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, Lemma 4.4