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

$P_t$ -free和Broom-free图中最大独立集的次指数时间算法

Subexponential-time Algorithms for Maximum Independent Set in $P_t$-free and Broom-free Graphs

Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen

摘要:

在算法图论中,一个经典的开放问题是确定无$P_t$图(即在$P_t$顶点上不包含任何诱导路径的图)上的最大独立集问题的复杂性。到目前为止,多项式时间算法仅已知用于$t\le 5$ [Lokshtanov等人,SODA 2014,570- 581,2014],以及最近公布的$t=6$算法[Grzesik et al. Arxiv 1707.05491,2017]。在这里,我们研究的问题的次指数时间算法的存在性:我们表明,对于任何$t\ge 1$,有一个算法的最大独立集的$P_t$ -免费的图,其运行时间是次指数的顶点数。即使是加权版本的MWIS,问题是可解的$2^{O(\sqrt {tn \log n})}$时间上的$P_t$ -自由图。对于MIS在无扫帚图中的逼近,证明了类似的时间界。离散集是最大独立集的推广,它要求解的顶点之间的距离至少为$d$。本文给出了$H$ -free图上的$d$ -Scattered集在输入大小下可以在时间次指数内求解的图的一个完全特征(即顶点数加上边数):如果$H$的每个分支都是一条路,则具有$n$顶点和$m$边的$H$ -free图上的$d$ -Scattered集可以在时间$2^{O(|V(H)|\sqrt{n+m}\log (n+m))}$上求解,即使$d$是输入的一部分。否则,在指数时间假设(ETH)下,对于$n$ -顶点和$m$ -边的$H$ -free图上的任意固定$d\ge 3$,不存在$d$ -Scattered集的$2^{o(n+m)}$ -时间算法.

英文摘要:

In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on $P_t$-free graphs, that is, on graphs not containing any induced path on $t$ vertices. So far, polynomial-time algorithms are known only for $t\le 5$ [Lokshtanov et al., SODA 2014, 570--581, 2014], and an algorithm for $t=6$ announced recently [Grzesik et al. Arxiv 1707.05491, 2017]. Here we study the existence of subexponential-time algorithms for the problem: we show that for any $t\ge 1$, there is an algorithm for Maximum Independent Set on $P_t$-free graphs whose running time is subexponential in the number of vertices. Even for the weighted version MWIS, the problem is solvable in $2^{O(\sqrt {tn \log n})}$ time on $P_t$-free graphs. For approximation of MIS in broom-free graphs, a similar time bound is proved. Scattered Set is the generalization of Maximum Independent Set where the vertices of the solution are required to be at distance at least $d$ from each other. We give a complete characterization of those graphs $H$ for which $d$-Scattered Set on $H$-free graphs can be solved in time subexponential in the size of the input (that is, in the number of vertices plus the number of edges): If every component of $H$ is a path, then $d$-Scattered Set on $H$-free graphs with $n$ vertices and $m$ edges can be solved in time $2^{O(|V(H)|\sqrt{n+m}\log (n+m))}$, even if $d$ is part of the input. Otherwise, assuming the Exponential-Time Hypothesis (ETH), there is no $2^{o(n+m)}$-time algorithm for $d$-Scattered Set for any fixed $d\ge 3$ on $H$-free graphs with $n$-vertices and $m$-edges.

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

↑