{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:06:29Z","timestamp":1725516389484},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540698401"},{"type":"electronic","value":"9783540698487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69848-7_84","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"1061-1076","source":"Crossref","is-referenced-by-count":4,"title":["Using EDP-Polynomials for Network Structure Optimization"],"prefix":"10.1007","author":[{"given":"Olga","family":"Gadyatskaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey","family":"Rodionov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Rodionova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"84_CR1","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? Inf. Processes\u00a01(2), 199\u2013203 (2001) (in Russian)","journal-title":"Inf. Processes"},{"key":"84_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/978-3-540-24768-5_46","volume-title":"ICCSA 2004","author":"O. Rodionova","year":"2004","unstructured":"Rodionova, O., Rodionov, A., Choo, H.: Network Probabilistic Connectivity: Optimal Structures. In: EWSA 2004. LNCS, vol.\u00a03047, pp. 431\u2013440. Springer, Heidelberg (2004)"},{"key":"84_CR3","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":"84_CR4","doi-asserted-by":"crossref","unstructured":"Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. In: Electro 1995 Int. Professional Program Proc., pp. 309\u2013333 (1995)","DOI":"10.1109\/ELECTR.1995.471030"},{"key":"84_CR5","unstructured":"Palmer, C.R., Siganos, G., Faloutsos, M., Faloutsos, C., Gibbons, P.B.: The connectivity and faulttolerance of the Internet topology. In: Workshop on Network-Related Data Management, NRDM- 2001 (2001), \n                    \n                      http:\/\/www.cs.ucr.edu\/~siganos\/papers\/nrdm.ps"},{"key":"84_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/11847366_11","volume-title":"High Performance Computing and Communications","author":"A. Rodionov","year":"2006","unstructured":"Rodionov, A., Rodionova, O.: Network Probabilistic Connectivity: Expectation of a Number of Disconnected Pairs of Nodes. In: Gerndt, M., Kranzlm\u00fcller, D. (eds.) HPCC 2006. LNCS, vol.\u00a04208, pp. 101\u2013109. Springer, Heidelberg (2006)"},{"key":"84_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-540-74484-9_46","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2007","author":"A. Rodionov","year":"2007","unstructured":"Rodionov, A., Rodionova, O.K., Choo, H.: On the Expected Value of a Number of Disconnected Pairs of Nodes in Unreliable Network. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part III. LNCS, vol.\u00a04707, pp. 534\u2013543. Springer, Heidelberg (2007)"},{"key":"84_CR8","unstructured":"Rodionov, A., Gadyatskaya, O.: Usage and Calculation of random graph\u2019s EDP-polynomial. In: Proceedings of ICMMG SBRAS (Papers of Third Asian International Workshop on Optimisation Problems of Complex Systems), Novosibirsk, pp. 93\u2013107 (2007) (in Russian)"},{"issue":"4b","key":"84_CR9","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":"84_CR10","first-page":"187","volume":"93","author":"C.J. Colbourn","year":"1993","unstructured":"Colbourn, C.J.: Some open problems on reliability polynomials. Congr. Numer.\u00a093, 187\u2013202 (1993)","journal-title":"Congr. Numer."},{"key":"84_CR11","first-page":"177","volume":"22","author":"M. Chari","year":"1997","unstructured":"Chari, M., Colbourn, C.J.: Reliability polynomials: a survey. J. Combin. Inform. System Sci.\u00a022, 177\u2013193 (1997)","journal-title":"J. Combin. Inform. System Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69848-7_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:10:06Z","timestamp":1620015006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69848-7_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540698401","9783540698487"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69848-7_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}