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

无向Hamilton性的行列式和

Determinant Sums for Undirected Hamiltonicity

Andreas Björklund

摘要:

我们提出了一个在$O^*(1.657^{n})$时间内运行的$n$ -顶点无向图的Hamilton性检测的Monte Carlo算法.据我们所知,这是自近50年前为TSP建立$O^*(2^n)$界(Bellman 1962,Held和Karp 1962)以来,对该问题最坏情况运行时间的第一次超多项式改进。它部分地回答了Woeginger在2003年关于NP难问题的精确算法的调查中的第一个开放问题。对于二部图,我们将其上界提高到$O^*(1.414^{n})$时间.在$n$中,利用空间多项式可以实现二分算法和一般算法。我们结合几个最近复活的想法得到的结果。我们的主要技术贡献是一个新的减少启发的代数筛选方法的$k$ -路径(Koutis ICALP 2008年,威廉姆斯IPL 2009年)。我们引入了标记循环覆盖和,其中我们被设置为在特征为2的有限域上计数加权弧标记循环覆盖。我们将哈密尔顿性简化为标记循环覆盖和,并应用精确集覆盖的行列式求和技术(Björklund STACS 2010)来评估它。

英文摘要:

We present a Monte Carlo algorithm for Hamiltonicity detection in an $n$-vertex undirected graph running in $O^*(1.657^{n})$ time. To the best of our knowledge, this is the first superpolynomial improvement on the worst case runtime for the problem since the $O^*(2^n)$ bound established for TSP almost fifty years ago (Bellman 1962, Held and Karp 1962). It answers in part the first open problem in Woeginger's 2003 survey on exact algorithms for NP-hard problems. For bipartite graphs, we improve the bound to $O^*(1.414^{n})$ time. Both the bipartite and the general algorithm can be implemented to use space polynomial in $n$. We combine several recently resurrected ideas to get the results. Our main technical contribution is a new reduction inspired by the algebraic sieving method for $k$-Path (Koutis ICALP 2008, Williams IPL 2009). We introduce the Labeled Cycle Cover Sum in which we are set to count weighted arc labeled cycle covers over a finite field of characteristic two. We reduce Hamiltonicity to Labeled Cycle Cover Sum and apply the determinant summation technique for Exact Set Covers (Björklund STACS 2010) to evaluate it.

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

↑