• Un Algoritmo Evolutivo para Resolver el Problema de Coloración Robusta 

      Lara Velázquez, Pedro; Gutiérrez Andrade, Miguel Ángel; Ramírez Rodríguez, Javier; López Bracho, Rafael (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 ...