10 search results - page 1 / 2 » Editing Graphs into Disjoint Unions of Dense Clusters |
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
AAIM
2009
Springer
13 years 11 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
ESCAPE
2007
Springer
13 years 8 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
WG
2010
Springer
13 years 3 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...