Pre-processings and Linear-Decomposition Algorithm to Solve the k-Colorability Problem

Corinne Lucet (1) , Florence Mendes (2) , Aziz Moukrim (3)

1 LaRIA - Laboratoire de Recherche en Informatique d'Amiens
2 Le2i - Laboratoire Electronique, Informatique et Image [UMR6306]
3 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]

We are interested in the graph coloring problem. We studied the effectiveness of some pre-processings that are specific to the k-colorability problem and that promise to reduce the size or the difficulty of the instances. We propose to apply on the reduced graph an exact method based on a linear-decomposition of the graph. We present some experiments performed on literature instances, among which DIMACS library instances.

Domaines: Recherche opérationnelle [math.OC]

Corinne Lucet, Florence Mendes, Aziz Moukrim. Pre-processings and Linear-Decomposition Algorithm to Solve the k-Colorability Problem. International Workshop on Experimental and Efficient Algorithms WEA'2004, May 2004, Brazil. pp.315-325. ⟨hal-00783886⟩