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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bar-Noy, A., Bellare, M., Halldórsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inform. and Comput. 140, 183–202 (1998)
Crainic, T.G., Nourredine, H.: Parallel Meta–Heuristics Applications. In: Alba, E. (ed.) Parallel Metaheuristics, John Wiley & Sons, Chichester (2005)
Croitoriu, C., Luchian, H., Gheorghies, O., Apetrei, A.: A new genetic graph coloring heuristic. Computational Symposium on Graph Coloring and Generalizations COLOR’02. [in:] Constraint Programming, Proc. of the Int. Conf. CP’02 (2002)
Cantú-Paz, E.: Efficient and accurate parallel genetic algorithms. Kluwer Academic Publishers, Dordrecht (2000)
Galinier, P., Hao, J.-K.: Hybrid evolutionary algorithms for graph coloring. J. Combinatorial Optimization, 374–397 (1999)
Garey, R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W.H. Freeman, New York (1979)
Jensen, T.R., Toft, B.: Graph coloring problems. Wiley Interscience, Hoboken (1995)
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Computer System Science 9, 256–278 (1974)
Johnson, D.S., Trick, M.A.: Cliques, coloring and satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discr. Math. and Theor. Comp. Sc., vol. 26 (1996)
Kokosiński, Z., Kołodziej, M., Kwarciany, K.: Parallel genetic algorithm for graph coloring problem. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3036, pp. 215–222. Springer, Heidelberg (2004)
Kokosiński, Z., Kwarciany, K., Kolodziej, M.: Efficient graph coloring with parallel genetic algorithms. Computing and Informatics 24, 123–148 (2005)
Kubicka, E., Schwenk, A.J.: An introduction to chromatic sums. In: Proc. 17th Annual ACM Computer Science Conf., pp. 39–45 (1989)
Kubicka, E., Kubicki, G., Kountanis, D.: Approximation algorithms for the chromatic sum. In: Sherwani, N.A., Kapenga, J.A., de Doncker, E. (eds.) Great Lakes CS Conference 1989. LNCS, vol. 507, pp. 15–21. Springer, Heidelberg (1991)
Małafiejski, M.: Sum Coloring of Graphs. In: Kubale, M. (ed.) Graph Colorings. Contemporary Mathematics, vol. 352, pp. 55–65. American Math. Society, New York (2004)
de Werra, D.: Heuristics for graph coloring. In: Tinhofer, G., et al. (eds.) Computational graph theory, pp. 191–208. Springer, Heidelberg (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kokosiński, Z., Kwarciany, K. (2007). On Sum Coloring of Graphs with Parallel Genetic Algorithms. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71618-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-71618-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71589-4
Online ISBN: 978-3-540-71618-1
eBook Packages: Computer ScienceComputer Science (R0)