{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:56:27Z","timestamp":1767772587242,"version":"3.41.0"},"reference-count":48,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T00:00:00Z","timestamp":1440979200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"QREN, in the scope of the Mais Centro Program and European Union's FEDER","award":["ICIS Project CENTRO-07-0224-FEDER-002003"],"award-info":[{"award-number":["ICIS Project CENTRO-07-0224-FEDER-002003"]}]},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UID\/MULTI\/00308\/2013"],"award-info":[{"award-number":["UID\/MULTI\/00308\/2013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:p>The exact calculation of all\u2010terminal reliability is not feasible in large networks. Hence estimation techniques and lower and upper bounds for all\u2010terminal reliability have been utilized. Here, we propose using an ordered subset of the mincuts and an ordered subset of the minpaths to calculate an all\u2010terminal reliability upper and lower bound, respectively. The advantage of the proposed new approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The proposed algorithm uses maximally disjoint minpaths, prior to their sequential generation, and also uses a binary decision diagram for the calculation of their union probability. The numerical results show that the proposed approach is computationally feasible, reasonably accurate and much faster than the previous version of the algorithm. This allows one to obtain tight bounds when it not possible to enumerate all mincuts or all minpaths as revealed by extensive tests on real\u2010world networks. \u00a9 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 66(4), 282\u2013295 2015<\/jats:p>","DOI":"10.1002\/net.21634","type":"journal-article","created":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T17:14:50Z","timestamp":1441214090000},"page":"282-295","source":"Crossref","is-referenced-by-count":23,"title":["An effective algorithm for computing all\u2010terminal reliability bounds"],"prefix":"10.1002","volume":"66","author":[{"given":"Jaime","family":"Silva","sequence":"first","affiliation":[{"name":"Department of Informatics Engineering, CISUC University of Coimbra P\u00f3lo 2, Pinhal de Marrocos 3030\u2010290 Coimbra Portugal"},{"name":"Department of Physics, CFC University of Coimbra 3004\u2010516 Coimbra Portugal"}]},{"given":"Teresa","family":"Gomes","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering University of Coimbra P\u00f3lo 2, Pinhal de Marrocos 3030\u2010290 Coimbra Portugal"},{"name":"INESC Coimbra Rua Antero de Quental 199 3000\u2010033 Coimbra Portugal"}]},{"given":"David","family":"Tipper","sequence":"additional","affiliation":[{"name":"Graduate Telecommunications and Networking Program University of Pittsburgh Pittsburgh Pennsylvania 15260"}]},{"given":"L\u00facia","family":"Martins","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering University of Coimbra P\u00f3lo 2, Pinhal de Marrocos 3030\u2010290 Coimbra Portugal"},{"name":"INESC Coimbra Rua Antero de Quental 199 3000\u2010033 Coimbra Portugal"}]},{"given":"Velin","family":"Kounev","sequence":"additional","affiliation":[{"name":"Graduate Telecommunications and Networking Program University of Pittsburgh Pittsburgh Pennsylvania 15260"}]}],"member":"311","published-online":{"date-parts":[[2015,8,31]]},"reference":[{"key":"e_1_2_7_2_1","unstructured":"ITU\u2010T Recommendation E.800: Quality of service and dependability vocabularySeptember2008."},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1979.5220476"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2008.2011854"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2003.816403"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1986.4335422"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1987.5222298"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/24.46454"},{"volume-title":"Algebraic graph theory","year":"1993","author":"Biggs N.","key":"e_1_2_7_9_1"},{"key":"e_1_2_7_10_1","doi-asserted-by":"crossref","unstructured":"K.Brace R.Rudell andR.Bryant Efficient implementation of a BDD package Proc 27th ACM\/IEEE Des Automation Conf 1990 ACM Orlando Florida USA June 1990 pp. 40\u201345.","DOI":"10.1145\/123186.123222"},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"volume-title":"The combinatorics of network reliability, The International Series of Monographs on Computer Science","year":"1987","author":"Colbourn C.J.","key":"e_1_2_7_12_1"},{"volume-title":"Introduction to algorithms","year":"2001","author":"Cormen T.H.","key":"e_1_2_7_13_1"},{"key":"e_1_2_7_14_1","unstructured":"Department of Energy Department of Energy Commission: Communications Requirements of Smart Grid Technologies DoE October 2010."},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1970.10481083"},{"key":"e_1_2_7_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1986.4335388"},{"key":"e_1_2_7_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.4.581"},{"key":"e_1_2_7_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0206011"},{"key":"e_1_2_7_19_1","unstructured":"T.GomesandJ.Craveirinha An alternative method for calculating the probability of an union of events \u2013ESREL 2002 Eur Conf Syst Dependability Saf Dec Making Risk Manag Lyon France Vol.2 19\u201021 March 2002 pp.426\u2013430."},{"key":"e_1_2_7_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/24.44172"},{"key":"e_1_2_7_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-5726-x"},{"key":"e_1_2_7_22_1","first-page":"714","article-title":"Computational investigations of all\u2010terminal network reliability via BDDs","volume":"82","author":"Imai H.","year":"1999","journal-title":"IEICE Trans Fundam"},{"key":"e_1_2_7_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210017"},{"key":"e_1_2_7_24_1","doi-asserted-by":"crossref","unstructured":"V.Kounev M.Levesque D.Tipper andT.Gomes On smart grid communications reliability 2015 11th Int Conf Des Reliable Commun Network (DRCN) Kanisan City USA March 2015 pp.33\u201340.","DOI":"10.1109\/DRCN.2015.7148982"},{"key":"e_1_2_7_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1987.5222436"},{"key":"e_1_2_7_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/24.126676"},{"key":"e_1_2_7_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-002-0010-2"},{"key":"e_1_2_7_28_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054199000186"},{"key":"e_1_2_7_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/bltj.20181"},{"key":"e_1_2_7_30_1","first-page":"627","article-title":"The analysis of redundancy networks","volume":"77","author":"Moskowitz F.","year":"1958","journal-title":"AIEE Trans Commun Electron"},{"key":"e_1_2_7_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1970.5216391"},{"key":"e_1_2_7_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20371"},{"volume-title":"Numerical recipes: The art of scientific computing","year":"2007","author":"Press W.H.","key":"e_1_2_7_33_1"},{"key":"e_1_2_7_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"e_1_2_7_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470745403"},{"key":"e_1_2_7_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.04.035"},{"key":"e_1_2_7_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2009.2020120"},{"key":"e_1_2_7_38_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198533863.001.0001","volume-title":"Network reliability and algebraic structures","author":"Shier D.R.","year":"1991"},{"key":"e_1_2_7_39_1","doi-asserted-by":"crossref","unstructured":"A.Shooman Algorithms for network reliability and connection availability analysis Professional Prog Proc Electro\/95 Int IEEE Boston MA USA Jun 1995 pp.309\u2013333.","DOI":"10.1109\/ELECTR.1995.471030"},{"key":"e_1_2_7_40_1","doi-asserted-by":"crossref","unstructured":"J.Silva T.Gomes D.Tipper L.Martins andV.Kounev An algorithm for computing all\u2010terminal reliability bounds 2014 6th Int Workshop on Reliable Network Des Model (RNDM) IEEE Barcelona Spain November 2014 pp.76\u201383.","DOI":"10.1109\/RNDM.2014.7014934"},{"key":"e_1_2_7_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00088-5"},{"key":"e_1_2_7_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.03.005"},{"key":"e_1_2_7_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-013-9815-x"},{"key":"e_1_2_7_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.851774"},{"key":"e_1_2_7_45_1","first-page":"366","volume-title":"Suboptimal cuts: Their enumeration, weight and number,\u201d Automata, languages and programming, Vol. 623 of Lecture Notes in Computer Science","author":"Vazirani V.V.","year":"1992"},{"key":"e_1_2_7_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/24.52639"},{"key":"e_1_2_7_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2010.2055924"},{"key":"e_1_2_7_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2157911"},{"key":"e_1_2_7_49_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.21634","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.21634","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.21634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T11:12:03Z","timestamp":1748603523000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.21634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,31]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1002\/net.21634"],"URL":"https:\/\/doi.org\/10.1002\/net.21634","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"type":"print","value":"0028-3045"},{"type":"electronic","value":"1097-0037"}],"subject":[],"published":{"date-parts":[[2015,8,31]]}}}