Buscar
Mostrando ítems 1-3 de 3
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
(Elsevier Science BvAmsterdamHolanda, 2000)
Complexity of the cluster deletion problem on subclasses of chordal graphs
(Elsevier Science, 2015-10)
We consider the following vertex-partition problem on graphs, known as the CLUSTER DELETION (CD) problem: given a graph with real nonnegative edge weights, partition the vertices into clusters (in this case, cliques) to ...