| 计算网络K-终端可靠性的一种K-树拆法 |
| |
| 引用本文： | 迟汉忠,李东魁.计算网络K-终端可靠性的一种K-树拆法[J].东北大学学报(自然科学版),1993(4). |
| |
| 作者姓名： | 迟汉忠 李东魁 |
| |
| 作者单位： | 东北工学院数学系
(迟汉忠)，东北工学院数学系(李东魁) |
| |
| 摘 要： | 给出了计算网络K-终端可靠性的一种K-树拆法,用这种方法,计算复杂网络K-终端可靠性时,不用求出全部K-树,从而有效地提高了计算速度。此方法也适用于有向网络。
|
| 关 键 词： | 网络 K—终端可靠性 K—树 剩余网络 |
A K-Tree Algorithm for Computing K- Terminal Reliability in Networks |
| |
| Chi Hanzhong,Li Dongkui.A K-Tree Algorithm for Computing K- Terminal Reliability in Networks[J].Journal of Northeastern University(Natural Science),1993(4). |
| |
| Authors: | Chi Hanzhong Li Dongkui |
| |
| Abstract: | This paper gives an K-tree algorithm for computing K-terminal reliability in complex networks. When the algorithm is in application to the computation of K-terminal reliability,it is unnecessary to find all K-tree in a network. It can also be applied to oriented networks. The method is therefore available to accelerate the computation. |
| |
| Keywords: | network K-terminal reliability K-tree redundant network |
| 本文献已被 CNKI 等数据库收录！ |
