| 一个平面运输网络所有最小割的算法 |
| |
| 引用本文： | 白堤. 一个平面运输网络所有最小割的算法[J]. 北京交通大学学报(自然科学版), 1996, 0(1) |
| |
| 作者姓名： | 白堤 |
| |
| 作者单位： | 北方交通大学数学系 |
| |
| 摘 要： | 对于一类可平面的运输网络，通过揭示最小割的结构性质，构造辅助图，将求网络的最小割问题转化为在辅助图上求最短路径问题，从而建立了求网络所有最小割的算法。
|
| 关 键 词： | 最大流，最小割，相通 |
An Algorithm for Finding All Minimum Cuts in Planar Transportation Networks |
| |
| Bai Di. An Algorithm for Finding All Minimum Cuts in Planar Transportation Networks[J]. JOURNAL OF BEIJING JIAOTONG UNIVERSITY, 1996, 0(1) |
| |
| Authors: | Bai Di |
| |
| Abstract: | For planar transportation networks, the structure properties of minimum cuts are discussed. Through constructing an associate graph, the problem finding all the minimum cuts in a network is transformed into finding all the shortest paths in the associate graph . |
| |
| Keywords: | ss: maximum flow minimum cut mutual reach |
| 本文献已被 CNKI 等数据库收录！ |
