Timeline for Algorithm for identifying correct subset
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 10, 2019 at 13:36 | comment | added | j_random_hacker | Glad to hear it :) | |
| Apr 10, 2019 at 13:29 | comment | added | Tormod | I had to google that. Yes, this seems to be a bipartite graph (which was a new term for me). Your approach does indeed make sense. And I agree that the vertices left without edges after the matching algorithm can be added arbitrarily because the opposing set will be fully covered. | |
| Apr 10, 2019 at 13:25 | vote | accept | Tormod | ||
| Apr 10, 2019 at 11:16 | history | answered | j_random_hacker | CC BY-SA 4.0 |