An exact method for graph coloring

Abstract : We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs. Moreover, our algorithms are the first to our knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method.
Type de document :
Article dans une revue
Computers and Operations Research, Elsevier, 2006, 33 (8), pp.2189-2207
Liste complète des métadonnées
Contributeur : Florence Mendes <>
Soumis le : lundi 4 février 2013 - 10:49:18
Dernière modification le : mardi 5 février 2013 - 10:30:28
Document(s) archivé(s) le : dimanche 5 mai 2013 - 03:57:59


Fichiers éditeurs autorisés sur une archive ouverte


  • HAL Id : hal-00783637, version 1



Corinne Lucet, Florence Mendes, Aziz Moukrim. An exact method for graph coloring. Computers and Operations Research, Elsevier, 2006, 33 (8), pp.2189-2207. 〈hal-00783637〉



Consultations de
la notice


Téléchargements du document