Timeline for K Paths between two nodes in a network
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2012 at 2:47 | history | edited | Dima Pasechnik | CC BY-SA 3.0 |
comment on non-directed case
|
| Dec 14, 2012 at 13:59 | comment | added | Dima Pasechnik | so your case is a subcase of the situation considered in the paper! | |
| Dec 14, 2012 at 13:54 | comment | added | Rene | but in my case, the graph is undirected and unweighted. In your paper, the theorem uses a directed and weighted graph. | |
| Dec 14, 2012 at 13:52 | vote | accept | Rene | ||
| Dec 14, 2012 at 13:52 | |||||
| Dec 14, 2012 at 13:44 | history | answered | Dima Pasechnik | CC BY-SA 3.0 |