An analysis of heuristics for vertex colouring

Authors:
Marco Chiarandini;Thomas Stützle
Affiliations:
University of Southern Denmark, Odense, Denmark;IRIDIA, Université Libre de Bruxelles, Brussels, Belgium
Venue:
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Year:
2010

Citing 8
Cited 2

Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
A correction to Brelaz's modification of Brown's coloring algorithm

Communications of the ACM
New methods to color the vertices of a graph

Communications of the ACM
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Recognizing Berge Graphs

Combinatorica
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Preface: Special issue on computational methods for graph coloring and its generalizations

Discrete Applied Mathematics
Graph Theory

Graph Theory

Using GRASP to solve the generalised graph colouring problem with application to cell site assignment

International Journal of Mobile Network Design and Innovation
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.