Sciweavers

COCOA
2008
Springer
14 years 29 days ago
Going Weighted: Parameterized Algorithms for Cluster Editing
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...
Sebastian Böcker, Sebastian Briesemeister, Qu...
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
14 years 3 months ago
A More Effective Linear Kernelization for Cluster Editing
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 ...
Jiong Guo