A Generalized Graph Strict Strong Coloring Algorithm

Authors:
Mourad Bouzenada;Meriem Bensouyad;Nousseiba Guidoum;Ahmed Reghioua;Djamel-eddine Saïdouni
Affiliations:
MISC Laboratory, University Mentouri Constantine, Algeria;MISC Laboratory, University Mentouri Constantine, Algeria;MISC Laboratory, University Mentouri Constantine, Algeria;MISC Laboratory, University Mentouri Constantine, Algeria;MISC Laboratory, University Mentouri Constantine, Algeria
Venue:
International Journal of Applied Metaheuristic Computing
Year:
2012

Citing 7
Cited 0

Total colourings of planar graphs with large girth

European Journal of Combinatorics
Vertex coloring with a distance restriction

Discrete Mathematics
Partial list colorings

Discrete Mathematics
Edge coloring of bipartite graphs with constraints

Theoretical Computer Science
A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks

NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
A strict strong coloring of trees

Information Processing Letters
A new kind of graph coloring

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.