I have a connected graph, each edge weight represents the maximum flow through that edge. I have a defined sink and source. I want to find out the node that should be removed in order to minimy flow through the network.

I have tried several things, on one hand I tried finding a heuristic... however there is no indicator of how much it can minimize the flow.

Also, I tried running Edmonds-Karp but everytime taking a node from the graph. In this way, it has to be run N times. This is too slow since I have around 100,000 nodes.

I am looking for an approach that is faster.