Heuristics for the Robust Coloring Problem
Let $G$ and $\bar{G}$ be complementary graphs. Given a penalty function defined on the edges of $G$, we will say that the rigidity of a $k$-coloring of $G$ is the sum of the penalties of the edges of G joining vertices of the same color. Based on the previous definition, the Robust Coloring Problem...
| Principais autores: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
Universidad de Costa Rica
2011-03-01
|
| coleção: | Revista de Matemática: Teoría y Aplicaciones |
| Acesso em linha: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/2119 |