We study the question of finding a set of at most k edges, whose removal makes the input n-vertex graph a disjoint union of s-clubs (graphs of diameter s). Komusiewicz and Uhlmann [DAM 2012] showed that Cluster Edge Deletion (i.e., for the case of 1-clubs (cliques)), cannot be solved in time $2^{o(k)}{n}^{O(1)}$ unless the Exponential Time Hypothesis (ETH) fails. But, Fomin et al. [JCSS 2014] showed that if the number of cliques in the output graph is restricted to d, then the problem (d-Cluster Edge Deletion) can be solved in time $O(2^{O(\sqrt{dk})}+m+n)$. We show that assuming ETH, there is no algorithm solving 2-Club Cluster Edge Deletion in time $2^{o(k)}{n}^{O(1)}$. Further, we show that the same lower bound holds in the case of s-Club d-Cluster Edge Deletion for any $s\ge 2$ and $d\ge 2$.

我们研究了寻找一组最多k个边的问题，这些边的去除使输入的n-顶点图成为s -clubs（直径为s的图）的不相交的并集。Komusiewicz和Uhlmann [DAM 2012]表明，群集边缘删除（例如，对于1俱乐部（clique）的情况）无法及时解决。$2^{Ø（ķ）}{ñ}^{Ø（\mathrm{1个}）}$除非指数时间假设（ETH）失败。但是，Fomin等。[JCSS 2014]表明，如果将输出图中的集团数量限制为d，则可以及时解决问题（d -Cluster Edge Deletion）$Ø（2^{Ø（\sqrt{dķ}）}+米+ñ）$。我们发现，假设ETH，没有算法求解2 -Club集群优势删除的时间$2^{Ø（ķ）}{ñ}^{Ø（\mathrm{1个}）}$。此外，我们表明，下界在相同的情况下，持有小号-Club d -cluster边缘清除任何$s\ge 2$ 和 $d\ge 2$。