An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925)
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 enhanced bitstring encoding for exact maximum clique search in sparse graphs |
scientific article; zbMATH DE number 6734198
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An enhanced bitstring encoding for exact maximum clique search in sparse graphs |
scientific article; zbMATH DE number 6734198 |
Statements
An enhanced bitstring encoding for exact maximum clique search in sparse graphs (English)
0 references
21 June 2017
0 references
maximum clique
0 references
bitstring
0 references
branch-and-bound
0 references
combinatorial optimization
0 references
