{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:52:21Z","timestamp":1648594341694},"reference-count":15,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1990,10]]},"DOI":"10.1016\/0140-3664(90)90132-z","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T22:34:07Z","timestamp":1060295647000},"page":"487-493","source":"Crossref","is-referenced-by-count":2,"title":["Reliability ranking of communication networks"],"prefix":"10.1016","volume":"13","author":[{"given":"Pietro","family":"Camarda","sequence":"first","affiliation":[]},{"given":"Mario","family":"Gerla","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0140-3664(90)90132-Z_BIB1","series-title":"Int. Conf. on Comput. Commun.","article-title":"Synthesis of reliable double loop topologies","author":"Camarda","year":"1988"},{"key":"10.1016\/0140-3664(90)90132-Z_BIB2","series-title":"The Combinatorics of Network Reliability","author":"Colboum","year":"1987"},{"issue":"No 2","key":"10.1016\/0140-3664(90)90132-Z_BIB3","article-title":"New topological formula and rapid algorithm for reliability analysis of complex networks","volume":"Vol R-27","author":"Satanarayana","year":"1978","journal-title":"IEEE Trans. Reliability"},{"issue":"No 3","key":"10.1016\/0140-3664(90)90132-Z_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/TCT.1973.1083657","article-title":"A Boolean algebra method for computing the terminal reliability in a communication network","volume":"Vol CT-20","author":"Fratta","year":"1973","journal-title":"IEEE Trans. on Circuit Theory"},{"issue":"No 3","key":"10.1016\/0140-3664(90)90132-Z_BIB5","doi-asserted-by":"crossref","DOI":"10.1109\/TR.1978.5220325","article-title":"An efficient method for reliability evaluation of a general network","volume":"Vol R-27","author":"Rai","year":"1978","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0140-3664(90)90132-Z_BIB6","series-title":"Proc. 1981 Itern. Conf. Parallel Processing","first-page":"79","article-title":"Multiterminal reliability analysis of distributed processing systems","author":"Grnarov","year":"1981"},{"key":"10.1016\/0140-3664(90)90132-Z_BIB7","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230110405","article-title":"Combinatorial properties of directed graphs useful in computing network reliability","volume":"Vol 11","author":"Satyanarayana","year":"1981","journal-title":"Networks"},{"issue":"No 3","key":"10.1016\/0140-3664(90)90132-Z_BIB8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190100311","article-title":"On unreliability polynomials and graph connectivity in reliable network synthesis","volume":"Vol 10","author":"Boesch","year":"1986","journal-title":"J. Graph Theory"},{"issue":"No 3","key":"10.1016\/0140-3664(90)90132-Z_BIB9","article-title":"Criteri ed algoritmi per l'analisi dell'affidabilita delle reti di communicazioni","volume":"Vol 5","author":"Barberis","year":"1977","journal-title":"CSELT-Rapporti tecnici"},{"issue":"No 3","key":"10.1016\/0140-3664(90)90132-Z_BIB10","doi-asserted-by":"crossref","DOI":"10.1137\/0608033","article-title":"Network resilience","volume":"Vol 8","author":"Colbourn","year":"1987","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"10.1016\/0140-3664(90)90132-Z_BIB11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230040202","article-title":"Exact calculation of computer network reliability","volume":"Vol 4","author":"Hansler","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0140-3664(90)90132-Z_BIB12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(88)90065-0","article-title":"Lower bounds on two-terminal network reliability","volume":"Vol 21","author":"Brecht","year":"1988","journal-title":"Discrete Applied Mathematics"},{"issue":"No 4","key":"10.1016\/0140-3664(90)90132-Z_BIB13","doi-asserted-by":"crossref","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of computing the probability that a graph is connected","volume":"Vol 12","author":"Provan","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0140-3664(90)90132-Z_BIB14","series-title":"IEEE INFOCOM '88","article-title":"Reliability comparison of computer networks","author":"Camarda","year":"1988"},{"issue":"No 2","key":"10.1016\/0140-3664(90)90132-Z_BIB15","doi-asserted-by":"crossref","DOI":"10.1109\/TR.1982.5221283","article-title":"Analysis of reliability block diagrams by Boolean techniques","volume":"Vol R-31","author":"Bennetts","year":"1982","journal-title":"IEEE Transactions Reliability"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:014036649090132Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:014036649090132Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T04:56:37Z","timestamp":1585112197000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/014036649090132Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["014036649090132Z"],"URL":"https:\/\/doi.org\/10.1016\/0140-3664(90)90132-z","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}