par Stützle, Thomas ;Chiarandini, Marco
Référence Lecture notes in computer science, 6049, page (326-337)
Publication Publié, 2010
Article révisé par les pairs
Résumé : Several heuristics have been presented in the literature for finding a proper colouring of the vertices of a graph using the least number of colours. These heuristics are commonly compared on a set of graphs that served two DIMACS competitions. This set does not permit the statistical study of relations between algorithm performance and structural features of graphs. We generate a new set of random graphs controlling their structural features and advance the knowledge of heuristics for graph colouring. We maintain and make all algorithms described here publically available in order to facilitate future comparisons. © Springer-Verlag Berlin Heidelberg 2010.

Documents en relation

DI-fusion