Genetic algorithm for black and white coloring problem on graphs
A classical problem in graph theory and combinatorial optimization is the known as Graph Coloring Problem (GC). This problem consists in assigning colors to vertices of a graph such that two adjacent vertices must have different colors. The objective in this problem is to find the minimum number of...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Universidad Autónoma del Estado de Morelos
2018-02-01
|
| Serie: | Programación Matemática y Software |
| Soggetti: | |
| Accesso online: | https://progmat.uaem.mx/progmat/index.php/progmat/article/view/219 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
