CHECKCOL: improved local search for graph coloring (Q2458929): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/jda/CaramiaDI06, #quickstatements; #temporary_batch_1731475607626 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jda/CaramiaDI06 / rank | |||
Normal rank | |||
Revision as of 06:53, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | CHECKCOL: improved local search for graph coloring |
scientific article |
Statements
CHECKCOL: improved local search for graph coloring (English)
0 references
5 November 2007
0 references
CHECKCOL is a heuristic based on local search that colours the vertices of a graph. Computational experiments demonstrate that CHECKCOL outperforms the best previously known algorithms on four DIMACS benchmark graphs.
0 references
combinatorial optimization
0 references
graph coloring
0 references
local search
0 references
tabu search
0 references
0 references
0 references
