【摘要】 本文提出一个计算无线广播网络（Radio－BroadcastNetwork称RBN）的K一终点可靠度（结点集合K中任何一对结点能彼此正常通讯的概率）方法．因为RBN的K-终点可靠度问题是个NP-困难问题，所以已有的结果只是一些近似算法和针对某些特殊RBN的算法．对一般RBN的K-终点可靠度研究很少．本文通过结合新提出的几个可靠性不变简化（Reliability－PreservingReducation）和对某些结点应用Pivotal分解定理，提出一个计算一般RBN的K-终点可靠度的有效算法．更多还原

【Abstract】 This paper presents a method for computing K-terminal reliability of RBN, the probability that any two nodes of set K can communicate with each other. Because K-terminal reliability problem of RBN is an NP-hard problem,the existing algorithms are only approximate for general RBN and only accurate for some restricted RBN, and little is known about accurate algorithm for general RBN. This paper, by conjugating with the new reliability-preserving reduction we present and applying pivotal decomposition theorem for some special nodes,presents an effective algorithm for computing K-terminal reliability of RBN.更多还原