Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements (Q2820111)
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 MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements |
scientific article; zbMATH DE number 6627273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements |
scientific article; zbMATH DE number 6627273 |
Statements
Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (English)
0 references
13 September 2016
0 references
maximum clique problem
0 references
MCS branch-and-bound algorithm
0 references
ILS heuristic
0 references
graph coloring
0 references
0 references
0.9243494868278505
0 references
0.8566017746925354
0 references
0.8277681469917297
0 references
0.8088366985321045
0 references
0.771806538105011
0 references
