Question: Let G = (V, E) be a flow network with source s, sink t, and integer capacities. Suppose that we are given a maximum flow
a. Suppose that the capacity of a single edge (u, v) ¬ E is increased by 1. Give an O (V + E)-time algorithm to update the maximum flow.
b. Suppose that the capacity of a single edge (u, v) ¬ E is decreased by 1. Give an O (V + E)-time algorithm to update the maximum flow.
Step by Step Solution
3.32 Rating (167 Votes )
There are 3 Steps involved in it
a Just execute one iteration of the FordFulkerson algorithm The edge u v in E with increased capacity ensures that the edge u v is in the residual gra... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
C-S-A (163).docx
120 KBs Word File
