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 the smallest s-t flow in G'? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
