Finding paths of length k in O*(2^k) time

Details Finding paths of length k in O*(2^k) time Finding paths of length k in O*(2^k) time

2008-07-18

arxiv.org/abs/0807.3026v3

Information Processing Letters, 109(6):315--318, February 2009

Computer Science

Data Structures and Algorithms

7 pages. Revised version to appear in Information Processing Letters

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Finding paths of length k in O*(2^k) time 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 Finding paths of length k in O*(2^k) time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding paths of length k in O*(2^k) time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-388744