摘要
为了寻求计算双终端网络系统最小割集更为简明的方法,扩展了网络联络矩阵的定义,形成了广义联络矩阵的概念,并基于此提出了一种矩阵分解算法,算法的基础是在一定运算规则下反复对广义联络矩阵进行分解.同时阐述了算法的理论原理及计算步骤,并给出了冗余节点、子图同构的判断方法和简化规则;算例验证了本理论的正确性和适应性.
The definition of adjacent matrix was extended in order to effectively enumerate all minimal cut-set of a terminal network. And a matrix decomposition algorithm was then proposed. The algorithm is based on recursive matrix decomposition and reduction. The theoretical rationale and operational rules are given. The judgment principles and reduction rules about redundant nodes and isomorphic graphs are presented. The examples given show correctness and applicability of the algorithm,
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2007年第2期123-126,共4页
Journal of Beijing University of Posts and Telecommunications
关键词
网络可靠度
最小割集
联络矩阵
network reliability
minimal cut-set
adjacent matrix
