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

Abstract : 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.
Type de document :
Communication dans un congrès
International Workshop on Experimental and Efficient Algorithms WEA'2004, May 2004, Brazil. 3054, pp.315-325, 2004
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00783886
Contributeur : Florence Mendes <>
Soumis le : mercredi 6 février 2013 - 08:46:04
Dernière modification le : mercredi 6 février 2013 - 09:27:01
Document(s) archivé(s) le : mardi 7 mai 2013 - 02:55:09

Fichiers

mendes.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00783886, version 1

Collections

Citation

C. 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. 3054, pp.315-325, 2004. <hal-00783886>

Partager

Métriques

Consultations de
la notice

182

Téléchargements du document

58