Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication (Q3558009)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication |
scientific article |
Statements
Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication (English)
0 references
29 April 2010
0 references
time complexity
0 references
graph algorithms
0 references
vertex-weighted graph
0 references
graph triangle
0 references
matrix multiplication
0 references
