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 is NP-complete but recently, several parameterized algorithms have been proposed. In this paper we present a surprisingly simple branching strategy for Cluster Editing. We generalize the problem assuming that edge insertion and deletion costs are positive integers. We show that the resulting search

• Type: Conference
• Year: 2008
• Where: COCOA
• Authors: Sebastian Böcker, Sebastian Briesemeister, Quang Bao Anh Bui, Anke Truß
• Keywords: Cluster Editing, Cluster Editing Problem, COCOA 2008, Discrete Geometry, Simple Branching Strategy