Timeline for Maximum cut variation
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 31, 2022 at 14:40 | history | edited | Weslley Lioba Caldas | CC BY-SA 4.0 |
deleted 67 characters in body
|
| Jul 31, 2022 at 14:39 | comment | added | Weslley Lioba Caldas | kabenyuk, your interpretation is correct, I will remove the figure to avoid misinterpretations. | |
| S Jul 31, 2022 at 2:38 | history | suggested | kabenyuk | CC BY-SA 4.0 |
improved formatting
|
| Jul 30, 2022 at 17:06 | comment | added | kabenyuk | Apparently, the problem is to find a subset $S$ of the set of vertices of graph $G$ such that the number of edges between $S$ and the complementary subset is maximal (that is, we deal with maximal cut) and the number of edges in $S$ is as small as possible. But this is what the example illustrates is not clear. | |
| Jul 30, 2022 at 16:56 | review | Suggested edits | |||
| S Jul 31, 2022 at 2:38 | |||||
| Jul 30, 2022 at 12:40 | comment | added | Brendan McKay | The question is unclear to me. | |
| Jul 30, 2022 at 6:30 | review | Close votes | |||
| Aug 2, 2022 at 16:27 | |||||
| S Jul 29, 2022 at 22:00 | review | First questions | |||
| Jul 30, 2022 at 6:10 | |||||
| S Jul 29, 2022 at 22:00 | history | asked | Weslley Lioba Caldas | CC BY-SA 4.0 |