An Experimental Comparison of Heuristic Coloring Algorithms in Terms of Found Color Classes on Random Graphs

  • Deniss KumlanderEmail author
  • Aleksei Kulitškov
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 991)


Well-known graph theory problems are graph coloring and finding the maximum clique in an undirected graph, or shortly - MCP. And these problems are closely related. Vertex coloring is usually considered an initial step before the start of finding maximum clique of a graph. The maximum clique problem is considered to be of NP-hard complexity, which means that there is no algorithm found that could solve this kind of problem in polynomial time. The maximum clique algorithms employ a lot the heuristic vertex coloring algorithm to find bounds and estimations. One class of such algorithms executes the coloring one only in the first stage, so those algorithms less concerned on the performance of the heuristic and more on the discovered colors. The researchers always face a problem, which heuristic vertex coloring algorithm should be selected to improve the performance of the core algorithm. Here we tried to give a lot of insights on existing heuristic vertex coloring algorithms and compare them identifying their ability to find color classes - 17 coloring algorithms are investigated: described and tested on random graphs.


Graph theory Vertex coloring Heuristic 


  1. 1.
    Kubale, M.: Graph Colorings. American Mathematical Society, US (2004)CrossRefGoogle Scholar
  2. 2.
    Kumlander, D.: Some practical algorithms to solve the maximum clique problem. Tallinn University of Technology, Tallinn (2005)zbMATHGoogle Scholar
  3. 3.
    Welsh, D.J.A., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10(1), 85–86 (1967)CrossRefGoogle Scholar
  4. 4.
    Hasenplaugh, W., Kaler, T., Schardl, T.B., Leiserson, C.E.: Ordering heuristics for parallel graph coloring. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures–SPAA’14, pp. 166–177 (2014)Google Scholar
  5. 5.
    Brelaz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251–256 (1979)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Andrews, P.S., Timmis, J., Owens, N.D.L., Aickelin, U., Hart, E., Hone, A., Tyrrell, A.M.: Artificial Immune Systems. York, UK (2009)CrossRefGoogle Scholar
  7. 7.
    Coleman, T.F., More, J.J.: Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 20, 187–209 (1983)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Almarabeh, H., Suleiman, A.: Heuristic algorithm for graph coloring based on maximum independent set. J. Appl. Comput. Sci. Math. 6(13), 9–18 (2012)Google Scholar
  9. 9.
    Al-Omari, H., Sabri, K.E.: New graph coloring algorithms. J. Math. Stat. 2(4), 439–441 (2006)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Saha, S., Baboo, G., Kumar, R.: An efficient EA with multipoint guided crossover for bi-objective graph coloring problem. In: Contemporary Computing: 4th International Conference-IC3 2011, pp. 135–145 (2011)Google Scholar
  11. 11.
    Jones, M.T., Plassmann, P.E.: A parallel graph coloring heuristic. SIAM J. Sci. Comput. 14(3), 654–669 (1993)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036–1053 (1986)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Matula, D.W., Marble, G., Isaacson, J.D.: Graph coloring algorithms. Academic Press, New York (1972)zbMATHGoogle Scholar
  14. 14.
    Allwright, J.R., Bordawekar, R., Coddington, P.D., Dincer, K., Martin, C.L.: A comparison of parallel graph coloring algorithms. Technical Report SCCS-666 (1995)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Tallinn University of TechnologyTallinnEstonia

Personalised recommendations