Pre-processings and Linear-Decomposition Algorithm to Solve the k-Colorability Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

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

Résumé

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.
Fichier principal
Vignette du fichier
mendes.pdf (203.77 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00783886 , version 1 (06-02-2013)

Identifiants

  • HAL Id : hal-00783886 , version 1

Citer

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⟩
186 Consultations
91 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More