通过Capped k-Walks更快地找到偶数圈
Finding Even Cycles Faster via Capped k-Walks
摘要:
本文考虑了在具有$n$节点和$m$边的无向图$G$中,对于常数$k\ge2$,求长为$2k$的圈(一个$C_{2k}$)的问题. Bondy和Simonovits [J.Comb.Th. '74]意味着如果$m \ge100k n^{1+1/k}$,则$G$包含$C_{2k}$,进一步意味着人们只需要考虑具有$m = O(n^{1+1/k})$的图。以前最著名的算法是Yuster和Zwick的$O(n^2)$算法[J.Disc.Math'97],以及Alon等人的$O(m^{2-(1+\lceil k/2\rceil^{-1})/(k+1)})$算法[Jumica'97]。我们提出了一个算法,使用$O(m^{2k/(k+1)})$时间,并找到一个$C_{2k}$,如果存在。当$O(n^2)$。对于$4$ -循环,我们的新界与Alon等人一致,而对于每一个$k>2$,我们的界产生$m$的多项式改进。Yuster和Zwick指出,“推测$O(n^2)$是$n$的最佳可能界是合理的“。我们展示了“条件最优性”:如果这个假设成立,那么我们的$O(m^{2k/(k+1)})$算法也是紧的。此外,民俗减少意味着,没有组合算法可以确定,如果一个图包含一个$6$ -周期的时间$O(m^{3/2-ε})$的任何$ε>0$下广泛相信的组合BMM猜想。再加上我们的主要结果,这给出了严格的界限,寻找$6$ -周期组合,也分离的复杂性,寻找$4$ -和$6$ -周期提供证据,$m$的指数在运行时间确实应该增加与$k$。在我们的算法中的关键成分是一个新的概念的上限$k$ -散步,这是散步的长度$k$,只访问节点根据一个固定的顺序。我们的主要技术贡献是一个复杂的分析证明了几个属性,这样的步行可能是独立的利益。
英文摘要:
In this paper, we consider the problem of finding a cycle of length $2k$ (a $C_{2k}$) in an undirected graph $G$ with $n$ nodes and $m$ edges for constant $k\ge2$. A classic result by Bondy and Simonovits [J.Comb.Th.'74] implies that if $m \ge100k n^{1+1/k}$, then $G$ contains a $C_{2k}$, further implying that one needs to consider only graphs with $m = O(n^{1+1/k})$. Previously the best known algorithms were an $O(n^2)$ algorithm due to Yuster and Zwick [J.Disc.Math'97] as well as a $O(m^{2-(1+\lceil k/2\rceil^{-1})/(k+1)})$ algorithm by Alon et al. [Algorithmica'97]. We present an algorithm that uses $O(m^{2k/(k+1)})$ time and finds a $C_{2k}$ if one exists. This bound is $O(n^2)$ exactly when $m=Θ(n^{1+1/k})$. For $4$-cycles our new bound coincides with Alon et al., while for every $k>2$ our bound yields a polynomial improvement in $m$. Yuster and Zwick noted that it is "plausible to conjecture that $O(n^2)$ is the best possible bound in terms of $n$". We show "conditional optimality": if this hypothesis holds then our $O(m^{2k/(k+1)})$ algorithm is tight as well. Furthermore, a folklore reduction implies that no combinatorial algorithm can determine if a graph contains a $6$-cycle in time $O(m^{3/2-ε})$ for any $ε>0$ under the widely believed combinatorial BMM conjecture. Coupled with our main result, this gives tight bounds for finding $6$-cycles combinatorially and also separates the complexity of finding $4$- and $6$-cycles giving evidence that the exponent of $m$ in the running time should indeed increase with $k$. The key ingredient in our algorithm is a new notion of capped $k$-walks, which are walks of length $k$ that visit only nodes according to a fixed ordering. Our main technical contribution is an involved analysis proving several properties of such walks which may be of independent interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。