Timeline for Bipartite Graphs - Maximum subset of one partition with at most n neighbours - NP-hard?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 21, 2015 at 13:28 | review | Suggested edits | |||
| Nov 21, 2015 at 15:42 | |||||
| Nov 21, 2015 at 11:22 | comment | added | Simon Razniewski | Thanks a lot, that looks elegant! Will credit you should this go any further. | |
| Nov 21, 2015 at 11:09 | vote | accept | Simon Razniewski | ||
| Nov 21, 2015 at 6:55 | history | answered | David Eppstein | CC BY-SA 3.0 |