@inproceedings{Bolton2013AutomaticallyGA, title={Automatically Generated Algorithms for the Vertex Coloring Problem}, author={Carlos Contreras Bolton and Gustavo Gatica and V{\'i}ctor Parada}, booktitle={PloS one}, year={2013} }

- Published 2013 in PloS one
DOI:10.1371/journal.pone.0058551

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 problem, its NP-hardness still represents a computational challenge. Some of the best computational results obtained for this problem are consequences of hybridizing the various known heuristics… CONTINUE READING

### Presentations referencing similar topics