查看: 3120|回复: 0

[问题求助] how to find overall min-cut separating some node pairs, not all node pairs

字体大小: 正常放大

xyw2013

1 主题	5 听众	2 积分

升级 40%

该用户从未签到

自我介绍: d

电梯直达

1^#

发表于 2012-12-20 10:59 |只看该作者 |正序浏览

|招呼Ta 关注Ta

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.

不好意思，我用英文至少为了把问题说的更清楚一点

zan

最小割, 切割, 网络