Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809)
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: Speeding up branch and bound algorithms for solving the maximum clique problem |
scientific article; zbMATH DE number 6312836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Speeding up branch and bound algorithms for solving the maximum clique problem |
scientific article; zbMATH DE number 6312836 |
Statements
Speeding up branch and bound algorithms for solving the maximum clique problem (English)
0 references
3 July 2014
0 references
maximum clique problem
0 references
branch and bound algorithm
0 references
heuristic solution
0 references
graph colouring
0 references
0 references
0 references
