Caricamento...
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...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Public Library of Science
2013
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3596313/ https://ncbi.nlm.nih.gov/pubmed/23516506 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0058551 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|