Consider a flow network with non-negative edge capacities. Show that there always exists a maximum flow f
Fantastic news! We've Found the answer you've been seeking!
Question:
Consider a flow network with non-negative edge capacities. Show that there always exists a maximum flow f in which either f (u,v) = 0 or f (v,u) = 0 for any pair of vertices.
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: