On Sum Coloring of Graphs with Parallel Genetic Algorithms

Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel genetic algorithm (PGA) can be efficiently used for computing approximate sum colorings and finding upper bounds for chromatic sums and chromatic sum numbers for hard– to–color graphs. Suboptimal sum coloring with PGA gives usually much closer upper bounds then theoretical formulas known from the literature.

• Type: Conference
• Year: 2007
• Where: ICANNGA
• Authors: Zbigniew Kokosinski, Krzysztof Kwarciany
• Keywords: Chromatic Sum, Chromatic Sum Numbers, ICANNGA 2007, Sum Coloring