arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.1706cs.DScs.DM
收藏

无牛图中加权独立集的改进FPT算法

Improved FPT algorithms for weighted independent set in bull-free graphs

Henri Perret du Cray, Ignasi Sau

摘要:

最近,Rumassé,Trotignon和Vuskovic [WG 2014]给出了一个用于无牛图中加权独立集的FPT算法,该算法由解的权重参数化,在时间上运行$2^{O(k^5)} \cdot n^9$。在本文中,我们将此运行时间改进为$2^{O(k^2)} \cdot n^7$。作为一个副产品,我们还改进了以前的图灵内核为这个问题从$O(k^5)$到$O(k^2)$。此外,对于$p \geq 3$的无洞图子类$2p-1$,我们加快了运行时间到$2^{O(k \cdot k^{\frac{1}{p-1}})} \cdot n^7$。随着$p$的增长,这个运行时间在$k$方面是渐近紧的,因为我们证明了对于每个整数$p \geq 3$,加权独立集不能在$\{bull,C_4,\ldots,C_{2p-1}\}$自由图类中的$2^{o(k)} \cdot n^{O(1)}$中及时求解,除非ETH失败。

英文摘要:

Very recently, Thomassé, Trotignon and Vuskovic [WG 2014] have given an FPT algorithm for Weighted Independent Set in bull-free graphs parameterized by the weight of the solution, running in time $2^{O(k^5)} \cdot n^9$. In this article we improve this running time to $2^{O(k^2)} \cdot n^7$. As a byproduct, we also improve the previous Turing-kernel for this problem from $O(k^5)$ to $O(k^2)$. Furthermore, for the subclass of bull-free graphs without holes of length at most $2p-1$ for $p \geq 3$, we speed up the running time to $2^{O(k \cdot k^{\frac{1}{p-1}})} \cdot n^7$. As $p$ grows, this running time is asymptotically tight in terms of $k$, since we prove that for each integer $p \geq 3$, Weighted Independent Set cannot be solved in time $2^{o(k)} \cdot n^{O(1)}$ in the class of $\{bull,C_4,\ldots,C_{2p-1}\}$-free graphs unless the ETH fails.

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

↑