Timeline for Maximum number of shortest-paths
Current License: CC BY-SA 2.5
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2010 at 13:56 | vote | accept | Eduardo | ||
| May 25, 2010 at 13:49 | vote | accept | Eduardo | ||
| May 25, 2010 at 13:49 | |||||
| May 25, 2010 at 13:49 | history | edited | Eduardo | CC BY-SA 2.5 |
acyclic -> cyclic
|
| May 25, 2010 at 13:28 | vote | accept | Eduardo | ||
| May 25, 2010 at 13:28 | |||||
| S May 25, 2010 at 13:28 | vote | accept | Eduardo | ||
| May 25, 2010 at 13:28 | |||||
| May 25, 2010 at 13:28 | vote | accept | Eduardo | ||
| S May 25, 2010 at 13:28 | |||||
| May 25, 2010 at 7:21 | answer | added | Roland Bacher | timeline score: 1 | |
| May 25, 2010 at 6:12 | comment | added | Hans-Peter Stricker | I guess Eduardo means loop-free graphs. | |
| May 25, 2010 at 3:02 | comment | added | Ryan Williams | An undirected acyclic graph is a disjoint collection of trees, so the number of shortest paths from s to t is either 1 or 0 depending on whether s and t are in the same connected component or not. However, since you mention grid graphs (which have many cycles!) maybe you want to edit your question. | |
| May 25, 2010 at 2:38 | answer | added | Douglas S. Stones | timeline score: 1 | |
| May 25, 2010 at 0:40 | history | asked | Eduardo | CC BY-SA 2.5 |