Timeline for Partition into paths in a Directed Acyclic Graphs
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 16, 2021 at 16:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 16, 2021 at 15:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 18, 2020 at 14:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 21, 2020 at 14:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 22, 2020 at 13:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 23, 2019 at 11:17 | answer | added | Laakeri | timeline score: 2 | |
| Dec 21, 2019 at 3:00 | history | tweeted | twitter.com/StackCompSci/status/1208220666002116609 | ||
| Dec 20, 2019 at 21:45 | comment | added | Narek Bojikian | I don't know if this helps, but since the problem is reduced to matching in bipartite gaphs you can check the b-matching problem in bipartite graphs. It also has a min-max characterization so a similar proof should work | |
| Dec 20, 2019 at 14:29 | history | asked | Farah Mind | CC BY-SA 4.0 |