Finding paths of length k in O*(2^k) time
Data Structures and Algorithms
2010-01-05 v3 Discrete Mathematics
Abstract
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.
Keywords
Cite
@article{arxiv.0807.3026,
title = {Finding paths of length k in O*(2^k) time},
author = {Ryan Williams},
journal= {arXiv preprint arXiv:0807.3026},
year = {2010}
}
Comments
7 pages. Revised version to appear in Information Processing Letters