Graph TheoryHardDirected Graphs and Network Flows
Directed Graphs and Network Flows · Hard problem
A flow network has source , sink , and vertices , with capacities , , , , , , . A flow sends , , , , , with fixed by conservation at and fixed by conservation at . Is this flow already maximum, and if so, what is the maximum flow value?