arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.7014cs.DMcs.DSmath.CO
收藏

图的平衡划分计算的参数化复杂性

On the Parameterized Complexity of Computing Balanced Partitions in Graphs

René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondřej Suchý

摘要:

平衡划分是将图聚类为给定数量的相等大小的部分。例如,二分问题要求删除最多k条边,以便将顶点划分为两个相等大小的部分。证明了在给定删除集的条件下,对分对于到常数宽度的距离是FPT的。这意味着FPT算法的一些充分研究的参数,如簇顶点删除数和反馈顶点集。然而,我们表明,二分法不承认这些参数的多项式大小的内核。对于顶点二分问题,需要移除顶点以获得两个大小相等的部分。我们表明,这个问题是FPT的删除顶点数k,如果解决方案将图切割成一个常数c的连通组件。后一个条件是不可避免的,因为我们还证明了顶点二分是W[1]-hard w.r.t.(k,c)。我们的算法寻找平分可以很容易地适应于寻找划分成d个相等大小的部分,这需要额外的运行时间因子n^{O(d)}。我们表明,大幅加速是不可能的,因为相应的任务是W[1]-硬w.r.t. d,即使在最大程度的森林2。然而,我们可以证明它是顶点覆盖数的FPT。

英文摘要:

A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition the vertices into two equal-sized parts. We prove that Bisection is FPT for the distance to constant cliquewidth if we are given the deletion set. This implies FPT algorithms for some well-studied parameters such as cluster vertex deletion number and feedback vertex set. However, we show that Bisection does not admit polynomial-size kernels for these parameters. For the Vertex Bisection problem, vertices need to be removed in order to obtain two equal-sized parts. We show that this problem is FPT for the number of removed vertices k if the solution cuts the graph into a constant number c of connected components. The latter condition is unavoidable, since we also prove that Vertex Bisection is W[1]-hard w.r.t. (k,c). Our algorithms for finding bisections can easily be adapted to finding partitions into d equal-sized parts, which entails additional running time factors of n^{O(d)}. We show that a substantial speed-up is unlikely since the corresponding task is W[1]-hard w.r.t. d, even on forests of maximum degree two. We can, however, show that it is FPT for the vertex cover number.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑