On Sum Coloring of Graphs with Parallel Genetic Algorithms

Authors:
Zbigniew Kokosiński;Krzysztof Kwarciany
Affiliations:
Cracow University of Technology, Faculty of Electrical & Computer Eng., ul. Warszawska 24, 31-155 Krakóóów, Poland and Tischner European University, ul. Westerplatte 11, 31-033 Krak ...;Cracow University of Technology, Faculty of Electrical & Computer Eng., ul. Warszawska 24, 31-155 Krakóóów, Poland
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Year:
2007

Citing 6
Cited 4

An introduction to chromatic sums

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
On chromatic sums and distributed resource allocation

Information and Computation
Efficient and Accurate Parallel Genetic Algorithms

Efficient and Accurate Parallel Genetic Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Algorithms for the Chromatic Sum

Proceedings of the The First Great Lakes Computer Science Conference on Computing in the 90's
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

An effective heuristic algorithm for sum coloring of graphs

Computers and Operations Research
A New Ant Colony Optimization Algorithm for the Lower Bound of Sum Coloring Problem

Journal of Mathematical Modelling and Algorithms
A study of breakout local search for the minimum sum coloring problem

SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
A memetic algorithm for the Minimum Sum Coloring Problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.