A new exact maximum clique algorithm for large and massive sparse graphs (Q342165)
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 6654084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new exact maximum clique algorithm for large and massive sparse graphs |
scientific article; zbMATH DE number 6654084 |
Statements
A new exact maximum clique algorithm for large and massive sparse graphs (English)
0 references
17 November 2016
0 references
branch and bound
0 references
bitstring
0 references
massive
0 references
sparse
0 references
maximum clique
0 references
0 references
0.9143269062042236
0 references
0.8894041180610657
0 references
0.8817254900932312
0 references
0.8402678966522217
0 references
0.8326959013938904
0 references
