{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T07:05:10Z","timestamp":1773731110389,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Ministry of Science and Technology","award":["MOST 102-2221-E-007-086-MY3"],"award-info":[{"award-number":["MOST 102-2221-E-007-086-MY3"]}]},{"name":"Ministry of Science and Technology","award":["MOST 104-2221-E-007-061-MY3"],"award-info":[{"award-number":["MOST 104-2221-E-007-061-MY3"]}]},{"name":"National Tsing Hua University \u201cToward World-Class Universities","award":["105N536CE1"],"award-info":[{"award-number":["105N536CE1"]}]},{"name":"Natural Science Foundation for Distinguished Young Talents in Higher Education of Guangdong Education Bureau","award":["2016KQNCX089"],"award-info":[{"award-number":["2016KQNCX089"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/tr.2017.2771495","type":"journal-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T17:20:33Z","timestamp":1516728033000},"page":"308-315","source":"Crossref","is-referenced-by-count":45,"title":["Fast Algorithm for Searching $d$ -MPs for all Possible $d$"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7393-0768","authenticated-orcid":false,"given":"Wei-Chang","family":"Yeh","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2013.2270418"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSEE.2012.00038"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2598562"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2004.05.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2005.09.009"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2008.927809"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2010.09.033"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250306"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00039-3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s001700200127"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPEL.2012.2192503"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11518-017-5343-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0143-8174(87)90050-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0951-8320(88)90122-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/24.75330"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198533863.001.0001","author":"shier","year":"1991","journal-title":"Network Reliability and Algebraic Structures"},{"key":"ref7","author":"colbourn","year":"1987","journal-title":"The Combinatorics of Network Reliability"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2012.03.005"},{"key":"ref9","author":"levitin","year":"2005","journal-title":"The Universal Generating Function in Reliability Analysis and Optimization"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-016-1903-8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601951"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2008.920792"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/07408170601013653"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(94)00121-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2015.04.013"},{"key":"ref26","article-title":"A novel algorithm for finding all new minimal paths in modified network problems","author":"yeh","year":"0","journal-title":"ISE Transactions"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2007.903290"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/24\/8305671\/08263221.pdf?arnumber=8263221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T18:02:02Z","timestamp":1719770522000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8263221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":27,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tr.2017.2771495","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"value":"0018-9529","type":"print"},{"value":"1558-1721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}