{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:08:15Z","timestamp":1747541295034,"version":"3.40.5"},"reference-count":36,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/rndm.2014.7014934","type":"proceedings-article","created":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T02:37:12Z","timestamp":1422067032000},"page":"76-83","source":"Crossref","is-referenced-by-count":5,"title":["An algorithm for computing all-terminal reliability bounds"],"prefix":"10.1109","author":[{"given":"Jaime","family":"Silva","sequence":"first","affiliation":[]},{"given":"Teresa","family":"Gomes","sequence":"additional","affiliation":[]},{"given":"David","family":"Tipper","sequence":"additional","affiliation":[]},{"given":"Lucia","family":"Martins","sequence":"additional","affiliation":[]},{"given":"Velin","family":"Kounev","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2003.816403"},{"journal-title":"Algebraic Graph Theory","year":"1993","author":"biggs","key":"35"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/24.44172"},{"key":"36","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"cayley","year":"1889","journal-title":"The Quarterly Journal of Pure and Applied Mathematics"},{"key":"18","first-page":"426","article-title":"An alternative method for calculating the probability of an union of events","volume":"2","author":"gomes","year":"2002","journal-title":"13-ESREL 2002 European Conference on System Dependability and Safety Decision Making and Risk Management"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1002\/bltj.20181"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1987.5222298"},{"journal-title":"Numerical Recipes 3rd Edition The Art of Scientific Computing","year":"2007","author":"press","key":"34"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/24.46454"},{"key":"13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/24.52639","article-title":"An improved minimizing algorithm for sum of disjoint products","volume":"39","author":"wilson","year":"1990","journal-title":"IEEE Transactions on Reliability"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/24.126676"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1979.5220476"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1987.5222436"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1970.5216391"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.1958.6372698"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.2307\/2283596"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.04.035"},{"key":"24","first-page":"1600","article-title":"A greedy algorithm for faster feasibility evaluation of all-terminal-reliable networks,\" systems, man, and cybernetics, part b: Cybernetics","volume":"41","author":"won","year":"2011","journal-title":"IEEE Transactions on"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/ELECTR.1995.471030"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1002\/net.20371"},{"key":"27","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/3-540-55719-9_88","article-title":"Suboptimal cuts: Their enumeration, weight and number","volume":"623","author":"vazirani","year":"1992","journal-title":"Automata Languages and Programming Ser Lecture Notes in Computer Science"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979225030X"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.02.047"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"2","article-title":"The combinatorics of network reliability, ser","author":"colbourn","year":"1987","journal-title":"The International Series of Monographs on Computer Science"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198533863.001.0001","author":"shier","year":"1991","journal-title":"Network Reliability and Algebraic Structures"},{"journal-title":"ITU-T","article-title":"Recommendation e.800: Quality of service and dependability vocabulary","year":"1994","key":"1"},{"key":"30","article-title":"A note on a simple algorithm to search all mcs in networks","author":"gomes","year":"2010","journal-title":"INESC Coimbra"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00088-5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1002\/9780470745403"},{"journal-title":"Department of Energy Commission Requirements for Smart Grid Technologies","year":"2010","key":"32"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.4.581"},{"journal-title":"California Energy Commission","year":"0","key":"31"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1986.4335422"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-5726-x"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2008.2011854"}],"event":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","start":{"date-parts":[[2014,11,17]]},"location":"Barcelona, Spain","end":{"date-parts":[[2014,11,19]]}},"container-title":["2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7000914\/7014920\/07014934.pdf?arnumber=7014934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T17:53:00Z","timestamp":1747504380000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7014934\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/rndm.2014.7014934","relation":{},"subject":[],"published":{"date-parts":[[2014,11]]}}}