Take the 2-minute tour ×
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

I have been told that there are some good polynomial time algorithms for approximating the number of simple paths in an directed graph from given starting vertex $s$ to given ending vertex $t$. Does anyone know of a good reference on this subject?

Background: counting the exact number of paths in a general graph is #P-complete but there may exist polynomial time approximations for the problem. I'm especially interested in random approximations.

Thanks in advance.

share|improve this question
    
I had the same problem e solve using Random Walk. –  user9913 Jun 28 '12 at 14:44
1  
@bbejot: See How hard is counting the number of simple paths between two nodes in a directed graph? The only answer, by jmad, provides a link to a paper that provides indeed a random approximation –  Carlos Linares López Nov 26 '12 at 22:11
    
Not sure if this helps, but you could use Balanced Families of Perfect Hash to approximate the number of simple paths of length $k$ in $2^{O(klogk)}$ which might be useful if you're looking for counting short paths. –  R B Jan 19 at 16:47
add comment

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.