6533b826fe1ef96bd1284417
RESEARCH PRODUCT
Pre-processings and Linear-Decomposition Algorithm to Solve the k-Colorability Problem
C. Lucet Florence Mendes Aziz Moukrimsubject
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO][INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO][ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]description
International audience; 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.
year | journal | country | edition | language |
---|---|---|---|---|
2004-05-01 |