Timeline for Relaxed path decomposition of a graph
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 2, 2016 at 20:52 | vote | accept | Elaqqad | ||
| Jul 2, 2016 at 20:52 | |||||
| Jun 27, 2016 at 7:00 | comment | added | Elaqqad | thank you for answer, sorry for the incomplete question (in the example I repeated a vertex two times) anyway I think that you provided a valid approach to the problem. What do you think about the minimality condition? (of small cardinal) | |
| Jun 26, 2016 at 21:48 | comment | added | David Eppstein | The part about repetition of vertexes is not in your question. | |
| Jun 26, 2016 at 19:34 | comment | added | Elaqqad | I actually added another note (that should be in the question) which is :any vertex of G can be reached from the initial vertex v, and in the definition of paths repetition of vertexes is allowed | |
| Jun 26, 2016 at 16:12 | history | answered | David Eppstein | CC BY-SA 3.0 |