[Solved]Given Directed Graph G V E Unit Capacity Edges Edge E Capacity C E 1 Source S V Sink T V Q37256156

You are given a directed graph G(V, E) with unit capacity edges(that is, on each edge e the capacity is c(e) = 1), source s ∈ Vand sink t ∈ V . Further, you are given an integer k. Find a set ofat most k edges to remove from G so that you decrease the value ofthe maximum flow the most. Provide an algorithm and analyze itscorrectness and running time

Expert Answer

---

Answer to You are given a directed graph G(V, E) with unit capacity edges (that is, on each edge e the capacity is c(e) = 1), sour… . . .