Abstract
The new algorithmic technique which allow higher efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges is considered in this paper. As graph's reliability we mean its probabilistic connectivity. The proposed technique is based on the reduction of the dimension of a calculated graph by considering its node's cuts. Comprehensive computer simulation results show the advantages of the proposed algorithms, that the calculation time decreases significantly in comparison with existent methods. © IFIP International Federation for Information Processing 2006.
Cite
CITATION STYLE
Migov, D. A., Rodionova, O. K., Rodionov, A. S., & Choo, H. (2006). Network probabilistic connectivity: Using node cuts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4097 LNCS, pp. 702–709). Springer Verlag. https://doi.org/10.1007/11807964_71
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
