利用逻辑扩展计算二终端网络可靠度  

Computing terminal-pair network reliability based on logical expansion

作　　者：王丽[1] 张红[2] 孙华娟[1] 赵连昌[1] 

机构地区：[1]大连海事大学数学系,辽宁大连116026 [2]大连水产学院理学院,辽宁大连116023

出　　处：《大连海事大学学报》2005年第3期100-103,共4页Journal of Dalian Maritime University

基　　金：国家自然科学基金资助项目(19871007)

摘　　要：利用布尔代数和不交和等方法提出了计算二终端网络可靠度的一个有效算法.运用简单方法将矩阵逻辑扩展中出现的大量的相同矩阵,进行合并,减少了矩阵数,从而有效地减少了运算时间.该算法推广和改进了S.Rai等在文献[1]中给出的计算二终端网络可靠度的算法.The author presented an algorithm for determination of terminal-pair reliability of a network by the concepts of Boolean algebra and sum of disjoint products. There were many same subgraphs during expanding matrixes of a network. It used the simple rules to merge these same matrixes so as to deduce the number of matrixes and the computing time effectively. The algorithm expands and improves the algorithm gived out in[1] by S. Rai, and it has more validity and universality.

关 键 词：二终端网络 网络可靠度 布尔矩阵 算法 

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