Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications (Q2931387): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/1132516.1132550 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2057393374 / rank | |||
Normal rank |
Latest revision as of 21:29, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications |
scientific article |
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