A 2-club is a graph of diameter at most two. In the decision version of the parametrized {\sc 2-Club Cluster Edge Deletion} problem, an undirected graph $G$ is given along with an integer $k\geq 0$ as parameter, and the question is whether $G$ can be transformed into a disjoint union of 2-clubs by deleting at most $k$ edges. A simple fixed-parameter algorithm solves the problem in $\mathcal{O}^*(3^k)$, and a decade-old algorithm was claimed to have an improved running time of $\mathcal{O}^*(2.74^k)$ via a sophisticated case analysis. Unfortunately, this latter algorithm suffers from a flawed branching scenario. In this paper, an improved fixed-parameter algorithm is presented with a running time in $\mathcal{O}^*(2.695^k)$.
翻译：2- club 是最多两个直径的图。 在 prometrized ~sc 2- Club Croup Edge Deletion} 问题的决定版本中, 给出了一个未定向的图形$G$, 加上一个整数 $k\geq 0 美元作为参数, 问题是$G$是否可以通过删除最多以美元为单位的边缘变成由2 Clubs组成的脱节组合。 简单的固定参数算法解决了 $\ mathcal{O ⁇ }( 3 ⁇ k) 的问题, 并声称通过复杂的案例分析, 一个长达十年的算法改善了运行时间 $\ mathcal{O\\\\\\\\\\\\\\\\\\\\\ (2. 74)k美元。 不幸的是, 后一种算法存在缺陷的分支情况。 在本文中, 一个改进的固定参数算法以$\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\。
相关内容
微信扫码咨询专知VIP会员