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&...

Volledige beschrijving

Bibliografische gegevens

Hoofdauteurs:	Arellano, Jikky Ann P. (Auteur), Barreta, Augustianne Laurenne L. (Auteur)
Andere auteurs:	Yusiong, John Paul T. (adviser.)
Formaat:	Thesis
Taal:	Engels
Gepubliceerd in:	2008.
Onderwerpen:	Graph Theory. Graph Coloring Problem. Chromatic Number. Brook's Theorem. Genetic Algorithm. Particle Swarm Optimization. Evolutionary Programming.