On sum coloring of graphs with parallel genetic algorithms / Zbigniew Kokosiński, Krzysztof Kwarciany // W: Adaptive and Natural Computing Algorithms : 8th International Conference, ICANNGA 2007, Warsaw, ... więcej

On sum coloring of graphs with parallel genetic algorithms / Zbigniew Kokosiński, Krzysztof Kwarciany // W: Adaptive and Natural Computing Algorithms : 8th International Conference, ICANNGA 2007, Warsaw, Poland, April 11-14, 2007 : proceedings, Pt. 1 [Dokument elektroniczny] / eds. Bartlomiej Beliczynski [et al.]. – Berlin ; Heidelberg : Springer, 2007. – (Lecture Notes in Computer Science, ISSN 1611-3349 ; 4431). – S. 211-219 : tab. – Tryb dostępu: https://link.springer.com/chapter/10.1007/978-3-540-71618-1_24. – Bibliogr. 17 poz., Abstr. – doi: 10.1007/978-3-540-71618-1_24. – ISBN 978-3-540-71618-1 (online). – ISBN 978-3-540-71589-4 (print)

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 ... więcej

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.