arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.11780cs.DS
收藏

稀疏有向图Hamilton性检测的一个渐近快速多项式空间算法

An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs

Andreas Björklund

摘要:

给出了一个多项式空间的Monte Carlo算法,该算法在给定$n$顶点上的有向图和平均出度$δ$的情况下,检测该图在$2^{n-Ω(\frac{n}δ)}$时间内是否存在Hamilton圈.这种运行时间节省的渐进缩放与Björklund和Williams ICALP 2019已知的最快指数空间算法相匹配。相比之下,Kowalik和Maheski的IPEC 2020之前最好的多项式空间算法保证了$2^{n-Ω(\frac{n}{2^δ})}$时间界限。我们的算法第一次结合了通过Björklund,Kaski和Koutis ICALP 2017中的图的拉普拉斯算子的包含-排除求和来获得哈密顿循环存在的指纹的想法,通过列出Björklund和Husfeldt FOCS 2013中$\mathbb{Z}_2$上线性方程组的解,筛选包含-排除求和中的非零项。

英文摘要:

We present a polynomial space Monte Carlo algorithm that given a directed graph on $n$ vertices and average outdegree $δ$, detects if the graph has a Hamiltonian cycle in $2^{n-Ω(\frac{n}δ)}$ time. This asymptotic scaling of the savings in the running time matches the fastest known exponential space algorithm by Björklund and Williams ICALP 2019. By comparison, the previously best polynomial space algorithm by Kowalik and Majewski IPEC 2020 guarantees a $2^{n-Ω(\frac{n}{2^δ})}$ time bound. Our algorithm combines for the first time the idea of obtaining a fingerprint of the presence of a Hamiltonian cycle through an inclusion--exclusion summation over the Laplacian of the graph from Björklund, Kaski, and Koutis ICALP 2017, with the idea of sieving for the non-zero terms in an inclusion--exclusion summation by listing solutions to systems of linear equations over $\mathbb{Z}_2$ from Björklund and Husfeldt FOCS 2013.

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

↑