Timeline for Decide if there is a sbugroup of edges in graph that every vertex meets exactly k edges from subgroup
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 5, 2017 at 21:42 | comment | added | Yuval Filmus | I doubt that your algorithm works. Try to find a counterexample. | |
| Dec 5, 2017 at 21:42 | answer | added | Yuval Filmus | timeline score: 1 | |
| Dec 5, 2017 at 11:40 | history | asked | DeJaVo | CC BY-SA 3.0 |