EPGraph evolutionary programming for Graph Coloring Problem
Graph Theory, Graph Coloring Problem (GCP) is a problem of assigning colors used is dictated by some k-coloring. This coloring is known as the chromatic number of a graph. To compute for the upper bound of the chromatic number, the authors used a concept of Graph Theory which can be proven by Brook&...
| Autors principals: | , |
|---|---|
| Altres autors: | |
| Format: | Thesis |
| Idioma: | English |
| Publicat: |
2008.
|
| Matèries: |