Determinant Sums for Undirected Hamiltonicity

Details Determinant Sums for Undirected Hamiltonicity Determinant Sums for Undirected Hamiltonicity

2010-08-03

arxiv.org/abs/1008.0541v1

Computer Science

Data Structures and Algorithms

To appear at IEEE FOCS 2010

Scientific paper

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\"orklund STACS 2010) to evaluate it.

Affiliated with

Also associated with

No associations

Rating

Determinant Sums for Undirected Hamiltonicity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Determinant Sums for Undirected Hamiltonicity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determinant Sums for Undirected Hamiltonicity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-614891