Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kubale, M.: Graph Colorings. American Mathematical Society, US (2004)
Kumlander, D.: Some practical algorithms to solve the maximum clique problem. Tallinn University of Technology, Tallinn (2005)
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)
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)
Brelaz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251–256 (1979)
Andrews, P.S., Timmis, J., Owens, N.D.L., Aickelin, U., Hart, E., Hone, A., Tyrrell, A.M.: Artificial Immune Systems. York, UK (2009)
Coleman, T.F., More, J.J.: Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 20, 187–209 (1983)
Almarabeh, H., Suleiman, A.: Heuristic algorithm for graph coloring based on maximum independent set. J. Appl. Comput. Sci. Math. 6(13), 9–18 (2012)
Al-Omari, H., Sabri, K.E.: New graph coloring algorithms. J. Math. Stat. 2(4), 439–441 (2006)
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)
Jones, M.T., Plassmann, P.E.: A parallel graph coloring heuristic. SIAM J. Sci. Comput. 14(3), 654–669 (1993)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036–1053 (1986)
Matula, D.W., Marble, G., Isaacson, J.D.: Graph coloring algorithms. Academic Press, New York (1972)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Kumlander, D., Kulitškov, A. (2020). An Experimental Comparison of Heuristic Coloring Algorithms in Terms of Found Color Classes on Random Graphs. In: Le Thi, H., Le, H., Pham Dinh, T. (eds) Optimization of Complex Systems: Theory, Models, Algorithms and Applications. WCGO 2019. Advances in Intelligent Systems and Computing, vol 991. Springer, Cham. https://doi.org/10.1007/978-3-030-21803-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-030-21803-4_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-21802-7
Online ISBN: 978-3-030-21803-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)