| 求网络割集的分裂方法 |
| |
| 引用本文： | 杭乃善,王佩璋. 求网络割集的分裂方法[J]. 广西大学学报(自然科学版), 1991, 0(1) |
| |
| 作者姓名： | 杭乃善 王佩璋 |
| |
| 作者单位： | 广西大学电气工程系，广西大学电气工程系 |
| |
| 摘 要： | 提出一种新的求网络割集的方法——分裂法,这种方法的特征是:先将网络划分为两个(或多个)子网络,分别求出这些较小网络的割集;然后.利用其中的一部分——关联割,再求出原网络中的其余割集.文中给出了一个详细的算例.
|
| 关 键 词： | 网络图论 割集 分裂法 |
The Disintegrating Method to Find Cutsets in Network |
| |
| Hang Naishan Wang Peizhang. The Disintegrating Method to Find Cutsets in Network[J]. Journal of Guangxi University(Natural Science Edition), 1991, 0(1) |
| |
| Authors: | Hang Naishan Wang Peizhang |
| |
| Affiliation: | Hang Naishan Wang Peizhang |
| |
| Abstract: | This paper presented a new method,disintegrating method, to find cutsets in network The main features of this method are that , firstly, the network is di- vided into two(or more)subnetworks and the cutsets is found in these relatively small net- works respcetively;then, the correlation cutsets, parts of the found cutsets is made use of to search out all the other cutsets of the primary network.A physical example is given to il- lustrate the algorithm in detail. |
| |
| Keywords: | network graph theory cutset disintegrating method |
| 本文献已被 CNKI 等数据库收录！ |
|
