K终端可靠度分解算法中多边形→链简化定理的完善

PERFECTION OF POLYGON-TO-CHAIN REDUCTIONS USED IN FACTORING ALGORITHM FOR K-TERMINAL NETWORK RELIABILITY

无向网络K终端可靠度的分解算法中,包括多边形→链简化在内的等可靠度简化和分解定理结合,可以降低算法的复杂度。本文完善了边随机无向网络和混合随机无向网络的4#,6#,7#型多边形→链简化定理。计算机编程验证了其正确性。

Reliability-preserving reductions including polygon-to-chain reductions are used in factoring algorithm for K-terminal network reliability to reduce the complexity. This article perfects 4#, 6#, 7# polygon-to-chain reductions for undirected networks with perfect vertices and networks with imperfect vertices. Programming in C language also proves it.