New Algorithm to Evaluate the Unreliability of Flow Networks Based on Minimal Cutsets  

作　　者：王芳 候朝桢 

机构地区：[1]School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China

出　　处：《Journal of Beijing Institute of Technology》2004年第1期24-28,共5页北京理工大学学报（英文版）

基　　金：SponsoredbytheMinisterialLevelAdvancedResearchFoundation ( 0 2 3 0 60 10 4)

摘　　要：Several conclusions on minimal cutset are proposed, from which a new algorithm is deduced to evaluate the unreliability of flow networks. Beginning with one unreliability product of the network, disjointed unreliability products are branched out one by one, every of which is selected from the network minimal cutsets. Finally the unreliability of the network is obtained by adding all these unreliability products up.Several conclusions on minimal cutset are proposed, from which a new algorithm is deduced to evaluate the unreliability of flow networks. Beginning with one unreliability product of the network, disjointed unreliability products are branched out one by one, every of which is selected from the network minimal cutsets. Finally the unreliability of the network is obtained by adding all these unreliability products up.

关 键 词：UNRELIABILITY flow networks minimal cutset 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]