Network Probabilistic Connectivity: Expectation of a Number of Disconnected Pairs of Nodes-Reference-Cited by-同舟云学术

Network Probabilistic Connectivity: Expectation of a Number of Disconnected Pairs of Nodes

Published:2006 Issue: Volume: Page:101-109
ISSN:0302-9743
Container-title:High Performance Computing and Communications
language:
Short-container-title:

Author:

Rodionov Alexey S.,Rodionova Olga K.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11847366_11.pdf

Reference10 articles.

1. Lecture Notes in Computer Science;O.K. Rodionova,2004

2. Krivoulets, V.G., Polesskii, V.P.: What is the Theory of Bounds for Network Reliability? Information Processes 1(2), 199–203 (2001)

3. Cancela, H., Petingi, L.: Diameter constrained network reliability: exact evaluation by factorization and bounds. In: Proc. of the Int. Conf. on Industrial Logistics, Japan, pp. 359–366 (2001)

4. Lucet, C., Manouvrier, J.-F.: Exact Methods to compute Network Reliability. In: Proc. of 1st International Conf. on Mathematical Methods in Reliability, Bucharest, Roumanie (September 1997), paper available via: http://ramp.ucsd.edu/resources.html

5. Satyanarayana, A., Chang, M.K.: Network reliability and the factoring theorem. Networks 13, 107–120 (1983)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Little tricks leading to a significant acceleration of the calculation of the reliability of a random graph;2023 17th International Conference on Ubiquitous Information Management and Communication (IMCOM);2023-01-03

2. Obtaining and Using Cumulative Bounds of Network Reliability;System Reliability;2017-12-20

3. Using EDP-Polynomials for Network Structure Optimization;Computational Science and Its Applications – ICCSA 2008

4. On the Expected Value of a Number of Disconnected Pairs of Nodes in Unreliable Network;Lecture Notes in Computer Science