Timeline for Finding all paths on undirected graph
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 19, 2010 at 13:23 | comment | added | MRA | I agree. Thanks for pointing out the flaw. | |
| Mar 19, 2010 at 13:10 | comment | added | Sangxia Huang | I think this is not an easy problem, and may not be able to compute efficiently. Trying to work out a proof on it. By the way, I think there may be some problems with @MRA's dynamic programming solution, because it seems that in the M_i's, there is no way to memorize whether a path has visited certain vertices, while we are required to find all simple paths. Therefore, the dynamic programming solution might include those paths with cycles, and thus would be incorrect. | |
| Mar 19, 2010 at 12:44 | history | answered | MRA | CC BY-SA 2.5 |