文章基本信息
- 标题：A Simple Algorithm for Undirected Hamiltonicity
- 本地全文：下载
- 作者：Hasan Abasi ; Nader Bshouty
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2013
- 卷号：2013
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
We develop a new algebraic technique that gives a simple randomized algorithm for the simple k-path problem with the same complexity O(1657k) as in [A. Bj\"orklund. Determinant Sums for Undirected Hamiltonicity. FOCS 2010, pp. 173--182, (2010). A. Bj\"orklund, T. Husfeldt, P. Kaski, M. Koivisto. Narrow sieves for parameterized paths and packings. {\it arXiv}:1007.1161v1, (2010).]
- 关键词：graph; Hamiltonicity; randomized algorithm; Simple path
