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

计算所有第二近邻大小的下限和上限

Lower and Upper Bound for Computing the Size of All Second Neighbourhoods

Gregory Gutin, George B. Mertzios, Felix Reidl

摘要:

我们考虑计算图的每个顶点的每个$r$ -邻域的大小的问题。具体来说,我们问是否可以在次二次时间计算封闭的第二个邻域的大小。调整Abboud等人的SETH约简。(2016)排除了次二次算法来计算图的半径,我们发现次二次算法会违反SETH。另一方面,Demaine等人(2014)的线性fpt时间算法由图的某个“稀疏参数”参数化,其中对参数的依赖性是指数的。我们在这里表明,一个更好的依赖是不可能的:对于任何~ $δ< 2$,没有算法运行在时间$O(2^{o({\rm vc}(G))} \, n^δ)$,其中~ ${\rm vc}(G)$是顶点覆盖数,是可能的,除非SETH失败。我们补充这些下限的算法,解决问题的时间~ $O(2^{{\rm vc}(G)/2} {\rm vc}(G)^2 \cdot n)$和$O(2^w w \cdot n)$。

英文摘要:

We consider the problem of computing the size of each $r$-neighbourhood for every vertex of a graph. Specifically, we ask whether the size of the closed second neighbourhood can be computed in subquadratic time. Adapting the SETH reductions by Abboud et al. (2016) that exclude subquadratic algorithms to compute the radius of a graph, we find that a subquadratic algorithm would violate the SETH. On the other hand, a linear fpt-time algorithm by Demaine et al. (2014) parameterized by a certain `sparseness parameter' of the graph is known, where the dependence on the parameter is exponential. We show here that a better dependence is unlikely: for any~$δ< 2$, no algorithm running in time $O(2^{o({\rm vc}(G))} \, n^δ)$, where~${\rm vc}(G)$ is the vertex cover number, is possible unless the SETH fails. We supplement these lower bounds with algorithms that solve the problem in time~$O(2^{{\rm vc}(G)/2} {\rm vc}(G)^2 \cdot n)$ and $O(2^w w \cdot n)$.

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

↑