# Timeline for Approximation for counting the number of simple $s$-$t$ paths in a general graph

### Current License: CC BY-SA 3.0

7 events
when toggle format what by license comment
Apr 12 '19 at 5:44 answer timeline score: 1
Nov 26 '12 at 22:11 comment @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
Jun 28 '12 at 14:44 comment user9913 I had the same problem e solve using Random Walk.
May 5 '11 at 17:31 history tweeted
May 4 '11 at 22:06 history edited
edited tags
May 4 '11 at 21:59 history edited
tex; spelling; edited tag
May 4 '11 at 20:50 history asked