Sorry, I didn't phrased my question clear enough. Say you are given "a directed network-flow graph G, and a paremeter k".
Every edge of G has capacity of 1, with source s, and sink t. You are allowed to delete any k EDGEs. What is an algorithm that would give a graph G' such that the maximum s-t flow in G' is the smallest? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
