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...
שמור ב:
| Principais autores: | , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Universidad Autónoma del Estado de Morelos
2018-02-01
|
| סדרה: | Programación Matemática y Software |
| נושאים: | |
| גישה מקוונת: | https://progmat.uaem.mx/progmat/index.php/progmat/article/view/219 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
