Timeline for Find a minimum set of paths that cover all pairs of dependent vertices
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 22, 2018 at 21:10 | comment | added | Moshe | @Ce Jin, thanks, but I think your solution is not correct! | |
| Feb 22, 2018 at 1:48 | comment | added | Ce Jin | I posted my answer to the same question here cstheory.stackexchange.com/a/40243/36593. | |
| Feb 8, 2018 at 20:54 | answer | added | Peter Heinig | timeline score: 1 | |
| Feb 5, 2018 at 10:00 | history | edited | Moshe | CC BY-SA 3.0 |
deleted 6 characters in body
|
| Feb 5, 2018 at 10:00 | comment | added | Moshe | I want to minimize number of paths. | |
| Feb 5, 2018 at 4:02 | comment | added | Brendan McKay | I'm confused by "minimum length $m$". Do you want to minimise the number of paths or the length of them? | |
| Feb 5, 2018 at 0:24 | history | edited | David Handelman | CC BY-SA 3.0 |
grammar and typos fixed
|
| Feb 4, 2018 at 22:12 | comment | added | Gerry Myerson | Possibly relevant question: mathoverflow.net/questions/242777/… | |
| Feb 4, 2018 at 20:17 | review | First posts | |||
| Feb 4, 2018 at 21:17 | |||||
| Feb 4, 2018 at 20:15 | history | asked | Moshe | CC BY-SA 3.0 |