求网络割集的分裂方法  

The Disintegrating Method to Find Cutsets in Network

作　　者：杭乃善[1] 王佩璋[1] 

机构地区：[1]广西大学电气工程系

出　　处：《广西大学学报（自然科学版）》1991年第1期26-33,共8页Journal of Guangxi University（Natural Science Edition）

摘　　要：提出一种新的求网络割集的方法——分裂法,这种方法的特征是:先将网络划分为两个(或多个)子网络,分别求出这些较小网络的割集;然后.利用其中的一部分——关联割,再求出原网络中的其余割集.文中给出了一个详细的算例.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.

关 键 词：网络图论 割集 分裂法 

分 类 号：O157.5[理学—数学]