As we know, now there is efficient algorithms to find the overall min-cut in a directed graph, e.g. Hao and Orlin (1994). 6 u- d* O" {. o, [# g2 x' d& m" D* R$ z$ ~5 j9 g7 J* \
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. / C8 H2 r7 M/ v% i
# x3 p) h% r- O8 Y5 M/ d( I
! v/ M3 D7 a% R
不好意思,我用英文至少为了把问题说的更清楚一点