arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.1672cs.DS
收藏

关于反馈顶点集:新测度与新结构

On Feedback Vertex Set: New Measure and New Structures

Yixin Cao, Jianer Chen, Yang Liu

摘要:

针对无向图上的{反馈点集}问题({ \sc fvs}),提出了一种新的参数化算法.我们通过考虑它的一个变体来处理这个问题,{不相交反馈顶点集}问题({ \sc disjoint-fvs}),它找到一个大小为$k$的反馈顶点集,该反馈顶点集与图$G$的给定反馈顶点集$F$没有重叠。我们开发了一个改进的核化算法{ \sc disjoint-fvs},并证明了{ \sc disjoint-fvs}可以在多项式时间内解决时,$G \setminus F$中的所有顶点的度上限为3。然后,我们提出了一个新的分支和搜索过程{ \sc disjoint-fvs},并介绍了一个新的分支和搜索措施。该过程有效地减少了一个给定的图的图上{ \sc disjoint-fvs}成为多项式时间可解的,和新的措施更准确地评估的效率的过程。这些算法和组合的研究,使我们能够开发一个$O^*(3.83^k)$的时间参数化算法的一般{ \sc fvs}问题,改善所有以前的算法的问题。

英文摘要:

We present a new parameterized algorithm for the {feedback vertex set} problem ({\sc fvs}) on undirected graphs. We approach the problem by considering a variation of it, the {disjoint feedback vertex set} problem ({\sc disjoint-fvs}), which finds a feedback vertex set of size $k$ that has no overlap with a given feedback vertex set $F$ of the graph $G$. We develop an improved kernelization algorithm for {\sc disjoint-fvs} and show that {\sc disjoint-fvs} can be solved in polynomial time when all vertices in $G \setminus F$ have degrees upper bounded by three. We then propose a new branch-and-search process on {\sc disjoint-fvs}, and introduce a new branch-and-search measure. The process effectively reduces a given graph to a graph on which {\sc disjoint-fvs} becomes polynomial-time solvable, and the new measure more accurately evaluates the efficiency of the process. These algorithmic and combinatorial studies enable us to develop an $O^*(3.83^k)$-time parameterized algorithm for the general {\sc fvs} problem, improving all previous algorithms for the problem.

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

↑