Graph TheoryHardDirected Graphs and Network Flows
Directed Graphs and Network Flows · Hard problem
A network has capacities , , , , , starting with zero flow. Push the augmenting path as far as it goes. What is then the residual capacity of the backward arc ?