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

  • Alexey S. Rodionov
  • Olga K. Rodionova
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4208)


The task of calculating the expectation of a number of disconnected pairs of nodes (EDP) in unreliable network is discussed. The task is NP-hard that is it requires complete enumeration of subgraphs. The techniques for decreasing a number of enumerated subgraphs by using the branching (factoring) method and taking advantage from possible structural features are discussed. Usage of chains, bridges, cutnodes and dangling nodes is considered.


Random Graph Network Reliability Complete Enumeration Dangling Node Probabilistic Connectivity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Rodionova, O.K., Rodionov, A.S., Choo, H.: Network Probabilistic Connectivity: Exact Calculation with Use of Chains. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3045, pp. 315–324. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. 2.
    Krivoulets, V.G., Polesskii, V.P.: What is the Theory of Bounds for Network Reliability? Information Processes 1(2), 199–203 (2001)Google Scholar
  3. 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)Google Scholar
  4. 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:
  5. 5.
    Satyanarayana, A., Chang, M.K.: Network reliability and the factoring theorem. Networks 13, 107–120 (1983)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. Electro/95 Int. Professional Program Proc., 309–333 (1995)Google Scholar
  7. 7.
    Moore, E.F., Shannon, C.E.: Reliable Circuits Using Less Reliable Relays. J. Franclin Inst. 262(4b), 191–208 (1956)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Palmer, C.R., Siganos, G., Faloutsos, M., Faloutsos, C., Gibbons, P.: The connectivity and faulttolerance of the Internet topology. In: Workshop on Network-Related Data Management (NRDM-2001) (2001),
  9. 9.
    Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 483–491. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Shooman, A.M., Kershenbaum, A.: Exact Graph-Reduction Algorithms for Network Reliability Analysis. In: Proc. GLOBECOM 1991, vol. 2, pp. 1412–1420 (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Alexey S. Rodionov
    • 1
  • Olga K. Rodionova
    • 1
  1. 1.Institute of Computational Mathematics and Mathematical Geophysics, Siberian Division of the Russian Academy of ScienceNovosibirskRussia

Personalised recommendations