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

Ful tanımlama

Detaylı Bibliyografya

Asıl Yazarlar:	Arellano, Jikky Ann P. (Yazar), Barreta, Augustianne Laurenne L. (Yazar)
Diğer Yazarlar:	Yusiong, John Paul T. (adviser.)
Materyal Türü:	Tez
Dil:	English
Baskı/Yayın Bilgisi:	2008.
Konular:	Graph Theory. Graph Coloring Problem. Chromatic Number. Brook's Theorem. Genetic Algorithm. Particle Swarm Optimization. Evolutionary Programming.