Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …
Given an undirected graph G=(V, E) and a nonnegative integer k, the NP-hard Cluster Editing problem asks whether G can be transformed into a disjoint union of cliques by …
S Kratsch, M Wahlström - ACM Transactions on Algorithms (TALG), 2014 - dl.acm.org
The Odd Cycle Transversal problem (OCT) asks whether a given undirected graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result, Reed, Smith, and …
S Böcker, J Baumbach - Conference on Computability in Europe, 2013 - Springer
Abstract The Cluster Editing problem asks to transform a graph into a disjoint union of cliques using a minimum number of edge modifications. Although the problem has been …
We introduce overlap cluster graph modification problems where, other than in most previous works, the clusters of the target graph may overlap. More precisely, the studied …
S Böcker - Journal of Discrete Algorithms, 2012 - Elsevier
The Cluster Editing problem asks to transform a graph by at most k edge modifications into a disjoint union of cliques. The problem is NP-complete, but several parameterized algorithms …
Abstract In the Cluster Editing problem, also known as Correlation Clustering, we are given an undirected n-vertex graph G and a positive integer k. The task is to decide if G can be …
Abstract The Parameterized Algorithms and Computational Experiments challenge (PACE) 2021 was devoted to engineer algorithms solving the NP-hard Cluster Editing problem, also …