Consider a flow network with non-negative edge capacities. Show that there always exists a maximum flow f

Related Book For  answer-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

Posted Date: