An exact bit-parallel algorithm for the maximum clique problem (Q709206)
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: An exact bit-parallel algorithm for the maximum clique problem |
scientific article; zbMATH DE number 5800844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact bit-parallel algorithm for the maximum clique problem |
scientific article; zbMATH DE number 5800844 |
Statements
An exact bit-parallel algorithm for the maximum clique problem (English)
0 references
15 October 2010
0 references
maximum clique
0 references
bit string
0 references
branch and bound
0 references
coloring
0 references
bit-parallelism
0 references
0.9100725054740906
0 references
0.8418999910354614
0 references
0.8361376523971558
0 references
0.8326959013938904
0 references
