Negative Triangle Search (Graph Triangle Problems)
Jump to navigation
Jump to search
Description
Given an $n$ node graph $G = (V, E)$ with edge weights $w: E \rightarrow W$, find a negative triangle, i.e. three vertices that form a triangle with total edge weights summing to a negative number.
Related Problems
Generalizations: Negative Triangle Detection
Subproblem: Negative Triangle Listing
Related: Nondecreasing Triangle, Minimum Triangle, Triangle in Unweighted Graph, Triangle Detection, Triangle Collection*
Parameters
n: number of vertices
m: number of edges
Table of Algorithms
Currently no algorithms in our database for the given problem.
Reductions TO Problem
| Problem | Implication | Year | Citation | Reduction |
|---|---|---|---|---|
| Negative Triangle Detection | if: to-time: $T(n)$ where $T(n)/n$ is decreasing then: from-time: $O(T(n))$ |
2018 | https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/3186893, Lemma 4.1 | link |