Now showing items 1-1 of 1

    • Heuristics for the Robust Coloring Problem 

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