Negative Triangle Detection
Given an node graph with edge weights , determine whether there is a negative triangle, i.e. three vertices that form a triangle with total edge weights summing to a negative number.
Parameters
- : number of nodes
- : number of edges
Related Problems
Insufficient data to display graph
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Insuffient Data to display table
Reductions Table
Displaying 27 of 27 reductions
Other relevant algorithms
Insuffient Data to display table