Now showing items 1-2 of 2

    • Bonomo, Flavia; Durán Maggiolo, Guillermo; Marenco, Javier; Valencia Pabon, Mario (Elsevier, 2011)
      In this paper, we study the minimum sum set coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersection of sets assigned to adjacent vertices ...
    • Bonomo, Flavia; Durán Maggiolo, Guillermo; Napoli, Amedeo; Valencia Pabon, Mario (Elsevier, 2015)
      In this note we show a one-to-one correspondence between potentially optimal solutions to the cluster deletion problem in a graph Gand potentially optimal solutions for the minimum sum coloring problem in G(i.e. the ...