[algogeeks] Re: smallest maximum s-t network flow

Sat, 01 Apr 2006 11:53:55 -0800

well to solve ur problem u just need to have the idea of MIN CUT.
 
Mahbub

 
On 3/19/06, geworm <[EMAIL PROTECTED]> wrote:

Forget it....This is obviously wrong, I seems to came up with a
solution to find the maximum s-t flow after deleting k edges.



--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to