{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:34:23Z","timestamp":1736573663458,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540393689"},{"type":"electronic","value":"9783540393726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847366_11","type":"book-chapter","created":{"date-parts":[[2006,9,8]],"date-time":"2006-09-08T20:50:18Z","timestamp":1157748618000},"page":"101-109","source":"Crossref","is-referenced-by-count":6,"title":["Network Probabilistic Connectivity: Expectation of a Number of Disconnected Pairs of Nodes"],"prefix":"10.1007","author":[{"given":"Alexey S.","family":"Rodionov","sequence":"first","affiliation":[]},{"given":"Olga K.","family":"Rodionova","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-24767-8_33","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"O.K. Rodionova","year":"2004","unstructured":"Rodionova, O.K., Rodionov, A.S., Choo, H.: Network Probabilistic Connectivity: Exact Calculation with Use of Chains. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03045, pp. 315\u2013324. Springer, Heidelberg (2004)"},{"issue":"2","key":"11_CR2","first-page":"199","volume":"1","author":"V.G. Krivoulets","year":"2001","unstructured":"Krivoulets, V.G., Polesskii, V.P.: What is the Theory of Bounds for Network Reliability? Information Processes\u00a01(2), 199\u2013203 (2001)","journal-title":"Information Processes"},{"key":"11_CR3","unstructured":"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\u2013366 (2001)"},{"key":"11_CR4","unstructured":"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"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1002\/net.3230130107","volume":"13","author":"A. Satyanarayana","year":"1983","unstructured":"Satyanarayana, A., Chang, M.K.: Network reliability and the factoring theorem. Networks\u00a013, 107\u2013120 (1983)","journal-title":"Networks"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. Electro\/95 Int. Professional Program Proc., 309\u2013333 (1995)","DOI":"10.1109\/ELECTR.1995.471030"},{"issue":"4b","key":"11_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","volume":"262","author":"E.F. Moore","year":"1956","unstructured":"Moore, E.F., Shannon, C.E.: Reliable Circuits Using Less Reliable Relays. J. Franclin Inst.\u00a0262(4b), 191\u2013208 (1956)","journal-title":"J. Franclin Inst."},{"key":"11_CR8","unstructured":"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), http:\/\/www.research.att.com\/~divesh\/papers\/cjfgs98-ir.ps"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-25978-7_49","volume-title":"Information Networking. Networking Technologies for Broadband and Mobile Networks","author":"A.S. Rodionov","year":"2004","unstructured":"Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol.\u00a03090, pp. 483\u2013491. Springer, Heidelberg (2004)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Shooman, A.M., Kershenbaum, A.: Exact Graph-Reduction Algorithms for Network Reliability Analysis. In: Proc. GLOBECOM 1991, vol.\u00a02, pp. 1412\u20131420 (1991)","DOI":"10.1109\/GLOCOM.1991.188601"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847366_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T20:12:37Z","timestamp":1736539957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847366_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540393689","9783540393726"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11847366_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}