Let's assume we have some network G, and for edges e_1, e_2 and e_n, there is constraint that they should have equal amount of flow. Given this constraint I want to find max flow.
Network Flow with equal flows on given edges constraint.
Let's assume we have some network G, and for edges e_1, e_2 and e_n, there is constraint that they should have equal amount of flow. Given this constraint I want to find max flow.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
xTemur | 2022-12-18 10:48:47 | 49 | Tiny change: '{e_2} = ..f_{e_k}$' -> '{e_2} = ...f_{e_k}$' | |
| en2 |
|
xTemur | 2022-12-18 10:41:18 | 231 | Tiny change: 'for edges e_1, e_2 and e_n, there is' -> 'for edges $e_1$, $e_2$ and $e_n$, there is' (published) | |
| en1 |
|
xTemur | 2022-12-18 10:36:00 | 235 | Initial revision (saved to drafts) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
