An exact method for graph coloring - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2006

An exact method for graph coloring

Résumé

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.
Fichier principal
Vignette du fichier
mendes.pdf (267.34 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-00783637 , version 1 (04-02-2013)

Identifiants

Citer

Corinne Lucet, Florence Mendes, Aziz Moukrim. An exact method for graph coloring. Computers and Operations Research, 2006, 33 (8), pp.2189-2207. ⟨10.1016/j.cor.2005.01.008⟩. ⟨hal-00783637⟩
145 Consultations
328 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More