On comparing algorithms for the maximum clique problem (Q1671301): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:54, 1 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
