Graph TheoryHardDirected Graphs and Network Flows
Directed Graphs and Network Flows · Hard problem
In the same kind of network — capacities , , , , , flow , , , , — how many arcs are saturated (flow equal to capacity)?
In the same kind of network — capacities , , , , , flow , , , , — how many arcs are saturated (flow equal to capacity)?