Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MaxCliqueDyn / rank | |||
Normal rank | |||
Revision as of 01:38, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up branch and bound algorithms for solving the maximum clique problem |
scientific article |
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
