论文部分内容阅读
通讯网络的可靠性是研究两个端点信息交流时建立联接的可靠性。任意一对节点,当他们之间建立联接时,由于相邻端点之间的联结有一个可靠性,人们希望选择一条具有最大可靠性的路进行联接。然而任一对节点间的路具有指数阶条,因此有必要寻找有效的算法来找出节点对间的最大可靠路网络。本文给出一个0(n2m)的算法来找出节点对间的最大可靠路网络。
The reliability of the communication network is to study the reliability of establishing the connection when the two endpoints exchange information. Any pair of nodes, when they establish a connection, because of the reliability of the connection between the adjacent endpoints, people want to choose the most reliable way to connect. However, the path between any pair of nodes has an exponential order, so it is necessary to find an effective algorithm to find the maximum reliable network between node pairs. This paper presents a 0 (n2m) algorithm to find the largest reliable network between nodes.