A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113)
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: A wide-ranging computational comparison of high-performance graph colouring algorithms |
scientific article; zbMATH DE number 6106557
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A wide-ranging computational comparison of high-performance graph colouring algorithms |
scientific article; zbMATH DE number 6106557 |
Statements
A wide-ranging computational comparison of high-performance graph colouring algorithms (English)
0 references
15 November 2012
0 references
graph colouring
0 references
metaheuristics
0 references
combinatorial optimisation
0 references
0 references
0 references
0 references
0 references
