Timeline for Subgraph containing all nodes and edges that are part of length-limited simple s-t paths in an undirected graph
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 1, 2014 at 13:22 | comment | added | greg | Thanks for the correction @RB. I edited my answer to note that it's wrong. | |
| Apr 1, 2014 at 13:22 | history | edited | greg | CC BY-SA 3.0 |
added 274 characters in body
|
| Mar 29, 2014 at 20:30 | comment | added | R B | This does not force the path to be simple. Consider the simple path graph $t-u-s-v-x$ and $l=4$. You will return $v$ as part of the output, although there's no simple s-t path that goes through $v$... | |
| Mar 29, 2014 at 20:27 | history | edited | greg | CC BY-SA 3.0 |
added 7 characters in body
|
| Mar 29, 2014 at 20:13 | history | edited | greg | CC BY-SA 3.0 |
added 342 characters in body
|
| Mar 29, 2014 at 20:05 | history | answered | greg | CC BY-SA 3.0 |