Minimum Triangle: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Minimum Triangle (Graph Triangle Problems)}} == Description == Find the triangle in a graph with minimum weight == Related Problems == Generalizations: Triangle Detection Related: Negative Triangle Detection, Negative Triangle Search, Negative Triangle Listing, Nondecreasing Triangle, Triangle in Unweighted Graph, Triangle Collection* == Parameters == <pre>n: number of vertices m: number of edges</pre> == Table of Algo...") |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
$n$: number of nodes | |||
m: number of edges | |||
$m$: number of edges | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Latest revision as of 09:27, 10 April 2023
Description
Find the triangle in a graph with minimum weight
Related Problems
Generalizations: Triangle Detection
Related: Negative Triangle Detection, Negative Triangle Search, Negative Triangle Listing, Nondecreasing Triangle, Triangle in Unweighted Graph, Triangle Collection*
Parameters
$n$: number of nodes
$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 |
|---|---|---|---|---|
| Second Shortest Simple Path | if: to-time: $T(n,W)$ where there are $n$ nodes and integer weights in $({0}, W)$ then: from-time: $T(O(n), O(nW))$ for $n$ node graph with integer weights in $(-W, W)$ |
2018 | https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 5.5 | link |