Timeline for Find multiple non-adjacent paths in a graph
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 27, 2014 at 11:30 | history | edited | Delio Mugnolo | CC BY-SA 3.0 |
added 121 characters in body
|
| Jun 27, 2014 at 10:57 | comment | added | lchen | Thanks for your comments. As Ben pointed out, the requirement of stronger non-adjacentment is essential in the problem. | |
| Jun 27, 2014 at 10:46 | comment | added | Ben Barber | That will do disjoint paths, but here there is the stronger requirement that the vertices are non-adjacent. There might be a way of using max-flow-min-cut type arguments, but it's not immediately clear. | |
| Jun 27, 2014 at 9:47 | history | answered | Delio Mugnolo | CC BY-SA 3.0 |