A branch and bound algorithm for the maximum clique problem (Q5905591)
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 95834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for the maximum clique problem |
scientific article; zbMATH DE number 95834 |
Statements
A branch and bound algorithm for the maximum clique problem (English)
0 references
16 January 1993
0 references
maximum clique
0 references
unconstrained quadratic zero-one programming
0 references
branch-and- bound
0 references
0 references
0 references
0.882620632648468
0 references
0.8618885278701782
0 references
0.8600407838821411
0 references
0.8467913866043091
0 references
