Finding the largest triangle in a graph in expected quadratic time (Q2184135)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the largest triangle in a graph in expected quadratic time |
scientific article |
Statements
Finding the largest triangle in a graph in expected quadratic time (English)
0 references
27 May 2020
0 references
applied probability
0 references
combinatorial optimization
0 references
max weight triangle
0 references
3-OPT TSP neighborhood
0 references
probabilistic analysis of algorithms
0 references
0 references
