Negative Triangle Detection: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:2811:28, 15 February 2023‎ Admin talk contribs‎ 8,131 bytes +8,131‎ Created page with "{{DISPLAYTITLE:Negative Triangle Detection (Graph Triangle Problems)}} == Description == Given an $n$ node graph $G = (V, E)$ with edge weights $w: E \rightarrow W$, determine whether there is a negative triangle, i.e. three vertices that form a triangle with total edge weights summing to a negative number. == Related Problems == Generalizations: Triangle Detection Subproblem: Negative Triangle Search Related: Negative Triangle Listing, Nondecreasing..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Negative_Triangle_Detection"