An exact bit-parallel algorithm for the maximum clique problem (Q709206): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 457 / rank | |||
Normal rank | |||
Revision as of 13:35, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact bit-parallel algorithm for the maximum clique problem |
scientific article |
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
