Affiliation:
1. University Constantine 2, Algeria
Abstract
This chapter examines the graph coloring problem. A graph strict strong coloring algorithm has been proposed for trees in Haddad and Kheddouci (2009). In this chapter, the authors recall the heuristic-based algorithm for general graphs named GGSSCA (for Generalized Graph Strict Strong Coloring Algorithm) proposed in Bouzenada, Bensouyad, Guidoum, Reghioua, and Saidouni (2012). The complexity of this algorithm is polynomial with considering the number of vertices. Later, in Guidoum, Bensouyad, and Saidouni (2013), GGSSCA was applied to solve the graph distribution problem.
Reference23 articles.
1. Partial list colorings
2. Systems and Software Verification
3. Bixby, R., & Kennedy, K. & Kremer, U. (1993). Automatic data layout using 0-1 integer programming (Tech. Rep. CRPC-TR93349-S). Houston, TX: Rice University, Center for Research on Parallel Computation.
4. Total Colourings of Planar Graphs with Large Girth
5. Bouneb, Z., & Saïdouni, D. (2009). Parallel state space construction for a model checking based on maximality semantics. In Proceedings of the 2nd Mediterranean Conference on Intelligent Systems and Automation (Vol. 1107, pp. 7-12). Zarzis, Tunisia: Academic Press. doi: 10.1063/1.3106517.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献