摘要
这篇文章考虑了网络从源点s到某些特定终点K的SKT可靠性问题．文章基于容斥原理和不交和公式提出一个新的拓扑公式，它比相应的Styaparaysnna公式含有更少的项和算术运算在此公式基础上，提出一个计算网络SKT可靠性算法，它改进了相应的Satysnaraysnna算法。
The problem of network reliability from source s to a specified set K is considered. It presents a new topological formula which contains less terms and operations than corresponding Satya-narayanna formula based on inclusion-Exclusion Principle and Disjoint Sum Formula. Based on this formula, a new algorithm is presented which improves the corresponding Satyanaraysnna algorithm and can generate compact reliability expression.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1998年第11期117-119,共3页
Acta Electronica Sinica
基金
863高技术研究与发展计划资助
