Timeline for Optimal prune of a mutually-exclusive bipartite graph
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2022 at 13:33 | vote | accept | Reinderien | ||
| Feb 9, 2022 at 9:19 | answer | added | Yuval Filmus | timeline score: 1 | |
| Feb 9, 2022 at 5:37 | comment | added | Yuval Filmus | Bipartite perfect matching is described in many sources. | |
| Feb 8, 2022 at 23:34 | comment | added | Reinderien | @YuvalFilmus So basically Bipartite min-cost perfect matching as described on page 12 of Cornell's Matchings notes | |
| Feb 7, 2022 at 20:14 | comment | added | Yuval Filmus | You can convert between the minimum and maximum versions of the problem by negating the edge weights. | |
| Feb 7, 2022 at 20:12 | comment | added | Yuval Filmus | A matching is always "disconnected and acyclic" (unless $|U|=|V|=1$). | |
| Feb 7, 2022 at 20:11 | comment | added | Yuval Filmus | Sounds very similar to maximum bipartite matching, a well-known problem with efficient algorithms. | |
| Feb 7, 2022 at 18:05 | history | asked | Reinderien | CC BY-SA 4.0 |