Going Weighted: Parameterized Algorithms for Cluster Editing

Abstract

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… (More)
DOI: 10.1007/978-3-540-85097-7_1

Topics

4 Figures and Tables

Slides referencing similar topics