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 the normal view instead:
scientific article; zbMATH DE number 6933493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8555233478546143
0 references
0.8499993085861206
0 references
0.8485282063484192
0 references
0.8428693413734436
0 references
0.8375842571258545
0 references
