Timeline for Minimum-cut with Maximal number of edges
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2019 at 7:01 | comment | added | Yuval Filmus | You can do it in various ways. I’ll let you work it out. | |
| Sep 29, 2019 at 0:34 | comment | added | AutoEncoder | @YuvalFilmus Thanks for the response, I have seen this link to find the minimum cut with the minimum number of edges. By removing small e, do you mean C * (|E| + 1) + 1 instead of + 1, I need to change it into C * (|E| + 1) - 1? | |
| Sep 28, 2019 at 23:20 | review | Close votes | |||
| Nov 3, 2019 at 3:01 | |||||
| Sep 28, 2019 at 23:04 | comment | added | Yuval Filmus | Possible duplicate of Minimum-cut with minimum number of edges | |
| Sep 28, 2019 at 23:03 | comment | added | Yuval Filmus | Remove $\epsilon$ from each weight, for small enough $\epsilon$. | |
| Sep 28, 2019 at 16:36 | history | edited | AutoEncoder | CC BY-SA 4.0 |
added 135 characters in body
|
| Sep 28, 2019 at 16:30 | review | First posts | |||
| Sep 28, 2019 at 23:19 | |||||
| Sep 28, 2019 at 16:29 | history | asked | AutoEncoder | CC BY-SA 4.0 |