| 枚举一个无向图所有最小割集的一种简单算法 |
| |
| 引用本文： | 乔文华. 枚举一个无向图所有最小割集的一种简单算法[J]. 阴山学刊, 1999, 0(5) |
| |
| 作者姓名： | 乔文华 |
| |
| 作者单位： | 包头师范高等专科学校物理学系 内蒙古包头014030 |
| |
| 摘 要： | 本文给出了一种求两终端无向图最小割集的新算法,此算法只需使用最简单的集合运算即可完成,得到的结果与用其它方法得到的结果完全相同,而这种算法无论对于手算还是计算机来完成都是容易的,在本文中算法的具体实现通过例子来说明.
|
| 关 键 词： | 网络 割集 最小割 |
A Simple Algorithm for Enumerating All the Minimal Cuts of An Undirected Graph |
| |
| Qiao Wenhua. A Simple Algorithm for Enumerating All the Minimal Cuts of An Undirected Graph[J]. Yin Shan Academic Journal, 1999, 0(5) |
| |
| Authors: | Qiao Wenhua |
| |
| Abstract: | In this paper,we have developed a new simple algorithm for enumenate all minimal cuts beetween terminal pair of anbitrary undirected graph. which could be finished by simple set operation. The result is the same to the one used by other method. Meanwhile this calculating method can be openated either by hand or by computer. The concrete caculating wethod is examplified in this article. |
| |
| Keywords: | network cutsets minimal cut |
| 本文献已被 CNKI 等数据库收录！ |
