Given a directed graph G with a source vertex s and a sink vertex t, what is the minimum number of edges that must be removed from G in order to prevent any path from s to t existing in the remaining graph? This is an instance of the min cut max flow theorem and finding an optimal solution is known to be an NP-complete problem.