Timeline for Minimizing flow on a 2D matrix network
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2021 at 0:56 | history | edited | j_random_hacker | CC BY-SA 4.0 |
Typo.
|
| May 6, 2021 at 0:55 | comment | added | j_random_hacker | Thanks! Thinking in terms of cuts rather than flows helped. | |
| May 5, 2021 at 19:32 | comment | added | D.W.♦ | @j_random_hacker, I added an explanation to the end of the answer (see the last paragraph). It is wordy and verbose, so I don't know whether it will be helpful. | |
| May 5, 2021 at 19:32 | history | edited | D.W.♦ | CC BY-SA 4.0 |
added 990 characters in body
|
| May 5, 2021 at 8:07 | comment | added | j_random_hacker | It now works on the small examples I've tried, but I'm not sure why it works! Could you explain? | |
| May 4, 2021 at 22:54 | comment | added | D.W.♦ | @j_random_hacker, good point. See edited answer - does this work now, or am I missing something again? | |
| May 4, 2021 at 22:53 | history | edited | D.W.♦ | CC BY-SA 4.0 |
deleted 50 characters in body
|
| May 4, 2021 at 21:15 | comment | added | j_random_hacker | If all capacities are 1, I don't think the blue nodes will have enough "pressure" to saturate all the white nodes. E.g., in a $2\times 2$ matrix with one blue node $b$, the sum of in-flows of its 2 white neighbours is at most 1 due to the $sb$ edge having capacity 1. | |
| May 4, 2021 at 6:00 | history | answered | D.W.♦ | CC BY-SA 4.0 |