Updating maximum flow Let G D .V; E/ be a flow network
Chapter 26, Problem 26-4(choose chapter or problem)
Updating maximum flow Let G D .V; E/ be a flow network with source s, sink t, and integer capacities. Suppose that we are given a maximum flow in G. a. Suppose that we increase the capacity of a single edge .u; / 2 E by 1. Give an O.V C E/-time algorithm to update the maximum flow. b. Suppose that we decrease the capacity of a single edge .u; / 2 E by 1. Give an O.V C E/-time algorithm to update the maximum flow.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer