As we know, now there is efficient algorithms to find the overall min-cut in a directed graph, e.g. Hao and Orlin (1994).
Now my problem is to find an overall min-cut just separating some given node pairs, not all the node pairs. For example, I have an 8-node digraph with capacities on each arc and want to find the overall min-cut separating some node pairs such as 8 and 1, 6 and 3, 7 and 1.
The algorithm of Hao and Orlin (1994) cannot solve my problem.
Thanks a lot.
Pinned topic how to find overall min-cut separating some node pairs, not all node pairs
Answered question This question has been answered.
Unanswered question This question has not been answered yet.
Updated on 2013-02-13T10:21:44Z at 2013-02-13T10:21:44Z by SystemAdmin
SystemAdmin 110000D4XK754 Posts
Re: how to find overall min-cut separating some node pairs, not all node pairs2013-02-13T10:21:44ZThis is the accepted answer. This is the accepted answer.What you are looking for is a minimum s-t cut. For example, you can apply the Edmonds-Karp algorithm (or any other min cut / max flow algorithm) for this.