Welcome to the InfoSci Platform
Reference Hub8
A Generalized Graph Strict Strong Coloring Algorithm

A Generalized Graph Strict Strong Coloring Algorithm

Mourad Bouzenada, Meriem Bensouyad, Nousseiba Guidoum, Ahmed Reghioua, Djamel-eddine Saïdouni
Copyright: © 2012 |Volume: 3 |Issue: 1 |Pages: 10
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781466610835|DOI: 10.4018/jamc.2012010103
Cite Article Cite Article

MLA

Bouzenada, Mourad, et al. "A Generalized Graph Strict Strong Coloring Algorithm." IJAMC vol.3, no.1 2012: pp.24-33. http://doi.org/10.4018/jamc.2012010103

APA

Bouzenada, M., Bensouyad, M., Guidoum, N., Reghioua, A., & Saïdouni, D. (2012). A Generalized Graph Strict Strong Coloring Algorithm. International Journal of Applied Metaheuristic Computing (IJAMC), 3(1), 24-33. http://doi.org/10.4018/jamc.2012010103

Chicago

Bouzenada, Mourad, et al. "A Generalized Graph Strict Strong Coloring Algorithm," International Journal of Applied Metaheuristic Computing (IJAMC) 3, no.1: 24-33. http://doi.org/10.4018/jamc.2012010103

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.