Triangle in Unweighted Graph: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Triangle in Unweighted Graph (Graph Triangle Problems)}} == Description == Find a triangle in an unweighted graph == Related Problems == Generalizations: Triangle Detection Related: Negative Triangle Detection, Negative Triangle Search, Negative Triangle Listing, Nondecreasing Triangle, Minimum Triangle, Triangle Collection* == Parameters == <pre>n: number of vertices m: number of edges</pre> == Table of Algorithms ==...") |
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 08:27, 10 April 2023
Description
Find a triangle in an unweighted graph
Related Problems
Generalizations: Triangle Detection
Related: Negative Triangle Detection, Negative Triangle Search, Negative Triangle Listing, Nondecreasing Triangle, Minimum Triangle, 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 FROM Problem
| Problem | Implication | Year | Citation | Reduction |
|---|---|---|---|---|
| Nondecreasing Triangle | if: to-time: $T(n)$ for unweighted graph then: from-time: $O(n^{3/2} \sqrt{T(O(n))})$ |
2018 | https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 7.1 | link |
| $(\min, \leq)$ Product | if: to-time: $T(n)$ for unweighted graph then: from-time: $O(n^{3/2} \sqrt{T(O(n))} \log n)$ |
2018 | https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 7.1 | link |