{"id":"https://openalex.org/W2159310985","doi":"https://doi.org/10.1109/iscc.2003.1214299","title":"Minimal cutset enumeration and network reliability evaluation by recursive merge and BDD","display_name":"Minimal cutset enumeration and network reliability evaluation by recursive merge and BDD","publication_year":2004,"publication_date":"2004-03-30","ids":{"openalex":"https://openalex.org/W2159310985","doi":"https://doi.org/10.1109/iscc.2003.1214299","mag":"2159310985"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2003.1214299","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2003.1214299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086445893","display_name":"Hung-Yau Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hung-Yau Lin","raw_affiliation_strings":["National Taiwan University, Taipei, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043885374","display_name":"Sy\u2010Yen Kuo","orcid":"https://orcid.org/0000-0002-3021-8321"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Sy-Yen Kuo","raw_affiliation_strings":["Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108532456","display_name":"Fu-Min Yeh","orcid":null},"institutions":[{"id":"https://openalex.org/I189290911","display_name":"National Chung Shan Institute of Science and Technology","ror":"https://ror.org/034ezwg26","country_code":"TW","type":"government","lineage":["https://openalex.org/I189290911"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Fu-Min Yeh","raw_affiliation_strings":["Chung-Shan Institute of Sciences and Technology, Taoyuan, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chung-Shan Institute of Sciences and Technology, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I189290911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":14.724,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.98517096,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1341","last_page":"1346"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6788086891174316},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.645350456237793},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6083081960678101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4968736469745636},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.4693908095359802},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4657868444919586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4656691551208496},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.463055819272995},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38381925225257874},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.372677743434906},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37121209502220154}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6788086891174316},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.645350456237793},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6083081960678101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4968736469745636},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.4693908095359802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4657868444919586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4656691551208496},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.463055819272995},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38381925225257874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.372677743434906},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37121209502220154},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iscc.2003.1214299","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2003.1214299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","raw_type":"proceedings-article"},{"id":"pmh:oai:140.112.114.62:246246/2007041910021008","is_oa":false,"landing_page_url":"http://ntur.lib.ntu.edu.tw//handle/246246/2007041910021008","pdf_url":null,"source":{"id":"https://openalex.org/S4306402491","display_name":"NTUR (\u81fa\u7063\u6a5f\u69cb\u5178\u85cf)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I16733864","host_organization_name":"National Taiwan University","host_organization_lineage":["https://openalex.org/I16733864"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1971708520","https://openalex.org/W1991536882","https://openalex.org/W2047694185","https://openalex.org/W2050858249","https://openalex.org/W2052453197","https://openalex.org/W2065317027","https://openalex.org/W2080267935","https://openalex.org/W2090564741","https://openalex.org/W2104109499","https://openalex.org/W2105526865","https://openalex.org/W2145704801","https://openalex.org/W2161391660","https://openalex.org/W2167046094","https://openalex.org/W2169751036","https://openalex.org/W2171492835"],"related_works":["https://openalex.org/W108845024","https://openalex.org/W4300125793","https://openalex.org/W2578985712","https://openalex.org/W2406961474","https://openalex.org/W2143566611","https://openalex.org/W2013740965","https://openalex.org/W588267724","https://openalex.org/W4297743441","https://openalex.org/W2952598754","https://openalex.org/W1994341438"],"abstract_inverted_index":{"One":[0,62],"of":[1,18,31,48,54,64,67,85,89,102,161,184,195,209,222],"the":[2,13,22,28,36,46,52,70,82,103,122,128,159,162,166,182,192,200,219],"key":[3],"tasks":[4],"in":[5],"network":[6,50,220,227],"reliability":[7,23,47,183,221],"evaluation":[8],"is":[9,56,69,144,203],"to":[10,44,59,80,99,134,147,157,180,217],"enumerate":[11,60,81],"all":[12,35,197],"paths":[14,55],"or":[15,94],"minimal":[16,37,83,126],"cutsets":[17,38,84,124,163,198],"a":[19,41,49,86,114,185,206,223],"network.":[20,74,186],"Then":[21],"can":[24,95,131,153,170],"be":[25,40,97,132,155,172],"calculated":[26],"from":[27],"disjoint":[29],"form":[30],"these":[32],"terms.":[33],"Enumerating":[34],"may":[39],"feasible":[42],"way":[43],"evaluate":[45,218],"if":[51],"number":[53,208],"too":[57],"huge":[58],"practically.":[61],"example":[63],"this":[65],"kind":[66],"networks":[68],"2/spl":[71,224],"times/100":[72,225],"lattice":[73,226],"Many":[75],"algorithms":[76],"have":[77],"been":[78],"proposed":[79],"graph.":[87],"Most":[88],"them":[90],"require":[91],"advanced":[92],"mathematics":[93],"only":[96],"applied":[98,133],"either":[100],"one":[101],"two":[104],"broad":[105],"categories,":[106],"directed":[107,136],"and":[108,116,127,137,149,211],"undirected":[109,138],"graphs.":[110],"This":[111,142,168],"paper":[112],"presents":[113],"simple":[115,146],"systematic":[117],"recursive":[118],"algorithm":[119,143,169],"that":[120,151],"guarantees":[121],"generated":[123,164],"are":[125],"same":[129],"logic":[130],"both":[135],"graphs":[139],"with":[140,174],"ease.":[141],"so":[145],"implement":[148],"efficient":[150],"it":[152,213],"also":[154,171],"used":[156],"check":[158],"correctness":[160],"by":[165],"algorithms.":[167],"combined":[173],"OBDD":[175],"(ordered":[176],"binary":[177],"decision":[178],"diagram)":[179],"calculate":[181],"Experimental":[187],"results":[188],"show":[189],"that:":[190],"(1)":[191],"running":[193],"time":[194],"enumerating":[196],"versus":[199],"graph":[201],"density":[202],"linear":[204],"for":[205],"given":[207],"nodes":[210],"(2)":[212],"takes":[214],"96.71":[215],"seconds":[216],"which":[228],"has":[229],"2/sup":[230],"99/":[231],"paths.":[232]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}