标题: how to find overall min-cut separating some node pairs, not all node pairs [打印本页] 作者: xyw2013 时间: 2012-12-20 10:59 标题: how to find overall min-cut separating some node pairs, not all node pairs As we know, now there is efficient algorithms to find the overall min-cut in a directed graph, e.g. Hao and Orlin (1994). ) u' a( \3 G, p2 S6 S3 O3 B" P. r) F# k9 l( a g; }, G9 ~% o
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. . x. ]4 O# z# H2 N) G
& ^8 o/ o$ W* f% y* d# g; y' L. H- P* B
不好意思，我用英文至少为了把问题说的更清楚一点