Question: Given a directed graph with source s and sink t, and capacities 1 over edges, show that two paths from s to t that carry

Given a directed graph with source s and sink t, and capacities 1 over edges, show that two paths from s to t that carry non-zero flow must be edge-disjoint. Show how to find in polynomial time the maximum number of edge disjoint s to t paths in the network
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
