Affiliation:
1. MISC Laboratory, University Mentouri Constantine, Algeria
Abstract
This paper examines the graph coloring problem. A graph strict strong coloring algorithm has been proposed for trees in Haddad and Kheddouci (2009). In this paper, the authors propose a new heuristic based algorithm for general graphs named GGSSCA (for Generalized Graph Strict Strong Coloring Algorithm). The authors show that the complexity of this algorithm is polynomial with considering the number of vertices.
Subject
Decision Sciences (miscellaneous),Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Computer Science Applications,Modeling and Simulation,Statistics and Probability
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A New and Fast Variant of the Strict Strong Coloring Based Graph Distribution Algorithm;Software Engineering Research, Management and Applications;2016
2. A New and Fast Evolutionary Algorithm for Strict Strong Graph Coloring Problem;Procedia Computer Science;2015
3. Strict Strong Graph Coloring;Proceedings of the The International Conference on Engineering & MIS 2015 - ICEMIS '15;2015
4. An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem;International Journal of Applied Evolutionary Computation;2014-04
5. A Generalized Graph Strict Strong Coloring Algorithm;Advances in Systems Analysis, Software Engineering, and High Performance Computing;2014