Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication (Q3558009)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication |
scientific article; zbMATH DE number 5702754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication |
scientific article; zbMATH DE number 5702754 |
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
0.9841756224632264
0 references
0.8815023303031921
0 references
0.8713415265083313
0 references
0.8288850784301758
0 references
0.805756688117981
0 references
