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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Public Library of Science (PLoS)
2013
|
| Subjects: | |
| Online Access: | https://doaj.org/article/8879908b9fdf450fae305f0a5c8ae694 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|