一个计算网络可靠度的递归算法  

A Recursive Algorithm for Computing Network Reliability

作　　者：牛义锋[1] 

机构地区：[1]河南理工大学数学与信息科学学院,河南焦作454000

出　　处：《计算技术与自动化》2009年第4期80-82,98,共4页Computing Technology and Automation

摘　　要：给出一个计算网络可靠度的有效算法,该算法的特点是结合概率论的有关知识和布尔代数运算:递归地调用一个简单、有效的概率公式来计算网络可靠度。该算法易于在计算机上操作和实现,从而适用于大型网络可靠度的定量计算。最后通过实例验证所给算法的有效性。An efficient algorithm for computing network reliability is presented,The algorithm has the following characteristics：combine the relevant knowledge of probability theory and the Boolean algebra computation, it recursively calls a simple and effective probability formula to compute network reliability. The algorithm is easy to operate on a computer, so it applies to quantitative calculation of Large-scale network reliability. Finally, the efficiency of the proposed algorithm is illustrated by an example.

关 键 词：网络可靠度 不交和 极小路 

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