Timeline for Finding Non-Simple Paths of a Given Length on a Graph
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 3, 2019 at 4:35 | answer | added | kglr | timeline score: 0 | |
| Jul 2, 2019 at 21:19 | vote | accept | smallscot | ||
| Jul 2, 2019 at 20:36 | answer | added | Szabolcs | timeline score: 4 | |
| Jul 2, 2019 at 19:24 | comment | added | smallscot | @Szabolcs what do you mean by a 'partial walk' and how would you program this? | |
| Jul 2, 2019 at 18:14 | comment | added | Szabolcs | This is easy; just take a partial walk, take the last vertex: you can extend the walk with any of its neighbours. The number of walks grows exponentially with their length. | |
| Jul 2, 2019 at 17:50 | history | asked | smallscot | CC BY-SA 4.0 |