Solving the graph coloring problem via hybrid genetic algorithms
Let G = (V,E) an undirected graph, V corresponds to the set of vertices and E corresponds to the set of edges, we focus on the graph coloring problem (GCP), which consist to associate a color to each vertex so that two vertices connected do not possess the same color. In this paper we propose a new...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2015-01-01
|
| Series: | Journal of King Saud University: Engineering Sciences |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1018363913000135 |