Network Flow with equal flows on given edges constraint.

Revision en1, by Tokyo_Drift, 2022-12-18 10:36:00

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.

Tags flow, graph

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Tokyo_Drift 2022-12-18 10:48:47 49 Tiny change: '{e_2} = ..f_{e_k}$' -> '{e_2} = ...f_{e_k}$'
en2 English Tokyo_Drift 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 English Tokyo_Drift 2022-12-18 10:36:00 235 Initial revision (saved to drafts)