On comparing algorithms for the maximum clique problem (Q1671301)
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: On comparing algorithms for the maximum clique problem |
scientific article; zbMATH DE number 6933493
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On comparing algorithms for the maximum clique problem |
scientific article; zbMATH DE number 6933493 |
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
0 references
0 references
0 references
0 references
0 references
