If we wanted to modify Ford Fulkerson so that it finds the path with maximum capacity, is this the same as finding the min-flow/max-cut? If so, is it possible to do this in O(m^2 log n log C) time where C is the number of iterations of the While loop and how?
Thanks, L.H. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
