{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:37:45Z","timestamp":1770993465052,"version":"3.50.1"},"reference-count":12,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6280,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1989,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Multiplictive inequalities for reliability bounds are derived, by observing that certain reliability measures are positively correlated. These inequalities can be used to obtain substantial improvements on available bounds for network reliability.<\/jats:p>","DOI":"10.1002\/net.3230190504","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T03:28:51Z","timestamp":1178940531000},"page":"521-529","source":"Crossref","is-referenced-by-count":9,"title":["Multiplicative improvements in network reliability bounds"],"prefix":"10.1002","volume":"19","author":[{"given":"Timothy B.","family":"Brecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles J.","family":"Colbourn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0603016"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90065-0"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230160404"},{"key":"e_1_2_1_5_2","volume-title":"The Combinatorics of Network Reliability","author":"Colbourn C. J.","year":"1987"},{"key":"e_1_2_1_6_2","first-page":"31","article-title":"The reliability polynomial","volume":"21","author":"Colbourn C. J.","year":"1986","journal-title":"Ars Combinatoria"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90193-8"},{"key":"e_1_2_1_8_2","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(66)80012-1"},{"key":"e_1_2_1_10_2","first-page":"165","article-title":"A lower boundary for the reliability of information networks","volume":"7","author":"Polesskii V. P.","year":"1971","journal-title":"Prof. Inf Trans."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130107"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010307"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02612335"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230190504","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230190504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T08:43:41Z","timestamp":1697964221000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230190504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["10.1002\/net.3230190504"],"URL":"https:\/\/doi.org\/10.1002\/net.3230190504","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}