Exact Triangle

Given an $n$ node graph $G = (V, E)$ with integer edge weights $w: E \rightarrow W$ , determine whether there is a zero triangle, i.e. three vertices that form a triangle with total edge weights summing to $0$ .

Parameters

$n$ : number of nodes
$m$ : number of edges

Related Problems

Exact Triangle2
- Real Exact Triangle
- All-Edges Exact Triangle1
- - Real All-Edges Exact Triangle1
  - #Real All-Edges Exact Triangle

Triangle Detection6
- Negative Triangle Detection1
- - Negative Triangle Search1
  - Negative Triangle Listing
- Nondecreasing Triangle
- Minimum Triangle
- Triangle in Unweighted Graph
- Triangle Listing
- Triangle Collection*

Edge Triangle Detection

Edge Triangle Counting

Vertex Triangle Listing

Dynamic Vertex Triangle Listing

Triangle Collection

All-Color-Pairs Triangle Collection*

All-Color-Pairs Triangle Collection

$\Delta$ -Matching Triangles

All-Edges Monochromatic Triangle1
- #All-Edges Monochromatic Triangle

Minimum Weight Triangle

Combinatorial Triangle Detection

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 6 of 6 reductions


Exact Triangle	Edge Triangle Detection	2024
Directed, Weighted APSP	Exact Triangle	2018
Exact Triangle	$\Delta$-Matching Triangles	2015
Exact Triangle	Triangle Collection*	2015
Convolution 3SUM	Exact Triangle	2013
Triangle Detection	Exact Triangle

Other relevant algorithms

Insuffient Data to display table