Buscar
Mostrando ítems 1-2 de 2
Un Algoritmo Evolutivo para Resolver el Problema de Coloración Robusta
Un Algoritmo Evolutivo para Resolver el Problema de Coloración Robusta
(2012-03-22)
Let G and \bar{G} be two complementary graphs. Given a penalty function defined over the edges of \bar{G}, it is said that the rigidity of a k-coloring of G is the summation ofthe penalties of the edges of G that join ...
Heuristics for the Robust Coloring Problem
Heurísticas para el Problema de Coloracion Robusta
(2011-03-18)
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 ...