Graph network flows
Problems on network flows, including maximum flow and minimum cut, circulations with demands, minimum-cost flow, transport and pipeline networks, assigning resources, and edge-disjoint paths.
Related problem sets are under Graph matchings, Graphs and Shortest paths.
Problems
Uniform flow#191
Very hard
Lands of Antarctica#1685
Medium
Decomposition of the Flow#1714
Very easy
Hackers#1715
Hard
Fake scoreboard#1822
Very easy
Poet#2078
Easy
Data Center Cooling#2093
Medium
Risk#2454
Very easy
Two Longest Paths#2627
Very hard
Spectrum Explorer#3050
Very easy
Coin Collecting#3065
Very hard
In and Out#3121
Hard
In Search of Brides#3509
Very easy
Mobile Network#3601
Very hard
Trust#3731
Hard
Flood#3944
Very hard