IMAS   23417
INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"
Unidad Ejecutora - UE
congresos y reuniones científicas
Título:
On the complexity of the cluster deletion problem for several graph classes
Autor/es:
BONOMO, FLAVIA; DURÁN, GUILLERMO; VALENCIA-PABON, MARIO
Lugar:
Pirenopolis
Reunión:
Workshop; VI Latin-American Workshop on Cliques in Graphs; 2014
Resumen:
We consider the following vertex-partition problem on graphs:
given a graph with real nonnegative edge weights, partition the
vertices into clusters (in this case cliques) to minimize the
total weight of edges out of the clusters. In this paper, the
complexity of this optimization problem is investigated for the
family of chordal graphs and cographs.