%0 Journal Article
%T Finding paths of length k in O*(2^k) time
%A Ryan Williams
%J Computer Science
%D 2008
%I arXiv
%X We give a randomized algorithm that determines if a given graph has a simple path of length at least k in O(2^k poly(n,k)) time.
%U http://arxiv.org/abs/0807.3026v3