Cargando…
Automatically Generated Algorithms for the Vertex Coloring Problem
The vertex coloring problem is a classical problem in combinatorial optimization that consists of assigning a color to each vertex of a graph such that no adjacent vertices share the same color, minimizing the number of colors used. Despite the various practical applications that exist for this prob...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2013
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3596313/ https://www.ncbi.nlm.nih.gov/pubmed/23516506 http://dx.doi.org/10.1371/journal.pone.0058551 |