{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:00:57Z","timestamp":1777561257796,"version":"3.51.4"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1109\/tr.2021.3075577","type":"journal-article","created":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T19:40:45Z","timestamp":1621885245000},"page":"390-403","source":"Crossref","is-referenced-by-count":20,"title":["An Innovative and Very Efficient Algorithm for Searching All Multistate Minimal Cuts Without Duplicates"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1224-6361","authenticated-orcid":false,"given":"Pawel Marcin","family":"Kozyra","sequence":"first","affiliation":[{"name":"Institute ofMathematics, Pedagogical University of Krakow, Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2008.06.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/qre.1772"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/24.210267"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/24.536994"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00039-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.02.022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2016.2606125"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/05695558308974623"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1985.5222235"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/24.257817"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/24.387394"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250306"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0951-8320(01)00110-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0951-8320(02)00038-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2004.833315"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2003.08.007"},{"key":"ref18","volume-title":"The Universal Generating Function in Reliability Analysis and Optimization","author":"Levitin","year":"2005"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2004.05.002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2005.853444"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601951"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/07408170500341270"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2006.874922"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2005.11.006"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1080\/07408170601013653"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2008.920792"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2008.2006293"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2008.2011660"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2007.70244"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2010.2046805"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2009.2034946"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2010.2055922"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2014.2299673"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2015.2430491"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2015.04.013"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2014.11.010"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2015.2452573"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2016.05.011"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2017.01.008"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2017.05.032"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s11518-017-5343-7"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1080\/24725854.2017.1410598"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2017.2771495"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2018.2829081"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2018.05.014"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.07.034"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2019.2935630"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2020.107202"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2019.2954894"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2020.107188"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2020.3004971"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/S0951-8320(03)00122-4"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1002\/qre.1772"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.02.047"},{"key":"ref56","article-title":"A note on a simple algorithm to search for all MCs in networks","author":"Forghani-elahabad","year":"2014"},{"key":"ref57","first-page":"22","article-title":"Cutset enumerating and network reliability computing by a new recursive algorithm and inclusion exclusion principle","volume":"45","author":"Benaddy","year":"2012","journal-title":"Int. J. Comput. Appl."},{"issue":"1","key":"ref58","first-page":"21","article-title":"Approximation of minimal cut sets for a flow network via evolutionary optimization and data mining techniques","volume":"7","author":"Zhang","year":"2010","journal-title":"Int. J. Performability Eng."},{"issue":"1","key":"ref59","first-page":"419","volume":"8","author":"Yeh","year":"2012","journal-title":"A new algorithm for finding all minimal cuts in modified networks. Int. J. Innov. Comput. Inf. Control"},{"issue":"1","key":"ref60","first-page":"544","volume":"27","author":"Sperner","year":"1928","journal-title":""},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1201\/chdismthapp"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/24\/9725327\/09439962.pdf?arnumber=9439962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T00:21:21Z","timestamp":1704846081000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9439962\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":61,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tr.2021.3075577","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"value":"0018-9529","type":"print"},{"value":"1558-1721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3]]}}}