Subexponential fixed-parameter tractability of cluster editing [article]

Fedor V. Fomin and Stefan Kratsch and Marcin Pilipczuk and Michał Pilipczuk and Yngve Villanger
<span title="2013-01-30">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In the Correlation Clustering, also known as Cluster Editing, we are given an undirected n-vertex graph G and a positive integer k. The task is to decide if G can be transformed into a cluster graph, i.e., a disjoint union of cliques, by changing at most k adjacencies, i.e. by adding/deleting at most k edges. We give a subexponential algorithm that, in time 2^O(sqrt(pk)) + n^O(1) decides whether G can be transformed into a cluster graph with p cliques by changing at most k adjacencies. We
more &raquo; ... ment our algorithmic findings by the following tight lower bounds on the asymptotic behaviour of our algorithm. We show that, unless ETH fails, for any constant 0 < s <= 1, there is p = Theta(k^s) such that there is no algorithm deciding in time 2^o(sqrt(pk)) n^O(1) whether G can be transformed into a cluster graph with p cliques by changing at most k adjacencies.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1112.4419v4">arXiv:1112.4419v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wrwtz2givvfyjfzefdluoq3n7u">fatcat:wrwtz2givvfyjfzefdluoq3n7u</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1112.4419/1112.4419.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1112.4419v4" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>