Show that in a network G with all Cij = I, the maximum
Chapter 23, Problem 23.7(choose chapter or problem)
Show that in a network G with all Cij = I, the maximum flow equals the number of edge-disjoint paths s ~ t.
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