Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications (Q2931387)
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 maximum weight triangle in n 3-Δ time, with applications |
scientific article; zbMATH DE number 6373894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications |
scientific article; zbMATH DE number 6373894 |
Statements
Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications (English)
0 references
25 November 2014
0 references
clique
0 references
dominating pairs
0 references
independent set
0 references
matrix multiplication
0 references
sub-cubic algorithm
0 references
triangle
0 references
0.8936862
0 references
0.89043593
0 references
0.8851666
0 references
0.87938845
0 references
0.87938845
0 references
0.87779415
0 references
0.8772246
0 references
0.87328064
0 references
0.86804515
0 references
0.8679241
0 references
