Cargando...
Polynomial Strategies for the 3-Coloring of a Graph.
The coloring of a graph is a problem of interest in the area of computer science due to the many applications it offers. The graph coloring problem has many utilities in areas like scheduling problems, frequency allocation, planning, etc. In the coloring of a graph, we want to color the nodes proper...
Guardado en:
| Publicado en: | Acta Universitaria |
|---|---|
| Autores principales: | , , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Universidad de Guanajuato
2012
|
| Materias: | |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=41623190008 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|