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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Carlos Contreras Bolton, Gustavo Gatica, Víctor Parada
Formato: article
Lenguaje:EN
Publicado: Public Library of Science (PLoS) 2013
Materias:
R
Q
Acceso en línea:https://doaj.org/article/8879908b9fdf450fae305f0a5c8ae694
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares