Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355)
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: Coloring graphs by iterated local search traversing feasible and infeasible solutions |
scientific article; zbMATH DE number 5228812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring graphs by iterated local search traversing feasible and infeasible solutions |
scientific article; zbMATH DE number 5228812 |
Statements
Coloring graphs by iterated local search traversing feasible and infeasible solutions (English)
0 references
21 January 2008
0 references
graph coloring benchmarks
0 references
heuristics
0 references
local search
0 references
vertex coloring
0 references
0 references
0.9258227
0 references
0.9209708
0 references
0.91429543
0 references
0.90595794
0 references
0.9022379
0 references
0.9013095
0 references
0.8972348
0 references
0 references
