On comparing algorithms for the maximum clique problem (Q1671301): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 05:05, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On comparing algorithms for the maximum clique problem |
scientific article |
Statements
On comparing algorithms for the maximum clique problem (English)
0 references
6 September 2018
0 references
maximum clique
0 references
experimental algorithms
0 references
random graphs
0 references
branch and bound
0 references
