A Generalized Graph Strict Strong Coloring Algorithm

Mourad Bouzenada, Meriem Bensouyad, Nousseiba Guidoum, Ahmed Reghioua and Djamel-eddine Saïdouni
Additional contact information
Mourad Bouzenada: MISC Laboratory, University Mentouri Constantine, Algeria
Meriem Bensouyad: MISC Laboratory, University Mentouri Constantine, Algeria
Nousseiba Guidoum: MISC Laboratory, University Mentouri Constantine, Algeria
Ahmed Reghioua: MISC Laboratory, University Mentouri Constantine, Algeria
Djamel-eddine Saïdouni: MISC Laboratory, University Mentouri Constantine, Algeria

International Journal of Applied Metaheuristic Computing (IJAMC), 2012, vol. 3, issue 1, 24-33

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.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jamc.2012010103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:3:y:2012:i:1:p:24-33

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().