TY - JOUR N2 - The following paper provides an insight into application of the contemporary heuristic methods to graph coloring problem. Variety of algorithmic solutions for the Graph Coloring Problem (GCP) are discussed and recommendations for their implementation provided. The GCP is the NP-hard problem, aiming at finding the minimum number of colors for vertices in such a way that none of two adjacent vertices are marked with the same color. With the advent of modern processing units metaheuristic approaches to solve GCP were extended to discrete optimization here. To explain the phenomenon of these methods, a thorough survey of AI-based algorithms for GCP is provided, with the main differences between specific techniques pointed out. L1 - http://www.czasopisma.pan.pl/Content/110219/PDF/32.pdf L2 - http://www.czasopisma.pan.pl/Content/110219 PY - 2019 IS - No 2 EP - 243 DO - 10.24425/ijet.2019.126306 KW - graph coloring KW - chromatic number KW - metaheuristics A1 - Bilski, Adrian PB - Polish Academy of Sciences Committee of Electronics and Telecommunications VL - vol. 65 DA - 2019.06.13 T1 - Contemporary Methods for Graph Coloring as an Example of Discrete Optimization SP - 235 UR - http://www.czasopisma.pan.pl/dlibra/publication/edition/110219 T2 - International Journal of Electronics and Telecommunications ER -