首页 | 本学科首页   官方微博 | 高级检索  
     

K终端可靠度分解算法中多边形→链简化定理的完善
引用本文:尹雨田,霍锡真.K终端可靠度分解算法中多边形→链简化定理的完善[J].电子与信息学报,1996(Z1).
作者姓名:尹雨田  霍锡真
作者单位:北京邮电大学应用科技系,北京邮电大学应用科技系 北京 100088,北京 100088
摘    要:无向网络K终端可靠度的分解算法中,包括多边形→链简化在内的等可靠度简化和分解定理结合,可以降低算法的复杂度。本文完善了边随机无向网络和混合随机无向网络的4#,6#,7#型多边形→链简化定理。计算机编程验证了其正确性。

关 键 词:分解算法  无向网络  等可靠度简化  多边形→链简化

PERFECTION OF POLYGON-TO-CHAIN REDUCTIONS USED IN FACTORING ALGORITHM FOR K-TERMINAL NETWORK RELIABILITY
Yin Yutian Huo Xizhen.PERFECTION OF POLYGON-TO-CHAIN REDUCTIONS USED IN FACTORING ALGORITHM FOR K-TERMINAL NETWORK RELIABILITY[J].Journal of Electronics & Information Technology,1996(Z1).
Authors:Yin Yutian Huo Xizhen
Abstract: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.
Keywords:Factoring algorithms  Undirected networks  Reliability preserving reductions  Polygonto-chain reductions
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号