{"id":"https://openalex.org/W1994983746","doi":"https://doi.org/10.1002/net.3230250304","title":"Threshold reliability of networks with small failure sets","display_name":"Threshold reliability of networks with small failure sets","publication_year":1995,"publication_date":"1995-05-01","ids":{"openalex":"https://openalex.org/W1994983746","doi":"https://doi.org/10.1002/net.3230250304","mag":"1994983746"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230250304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230250304","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-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/A5035102045","display_name":"Michael O. Ball","orcid":"https://orcid.org/0000-0003-2757-8569"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael O. Ball","raw_affiliation_strings":["University of Maryland, College Park, Maryland, 20742-1815","University of Maryland, College Park, Maryland, 20742\u20101815"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Maryland, 20742-1815","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland, College Park, Maryland, 20742\u20101815","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038186370","display_name":"Jane N. Hagstrom","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jane N. Hagstrom","raw_affiliation_strings":["University of Illinois, Chicago, Illinois 60680","University of Illinois Chicago, Illinois 60680"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Chicago, Illinois 60680","institution_ids":["https://openalex.org/I39422238"]},{"raw_affiliation_string":"University of Illinois Chicago, Illinois 60680","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005781105","display_name":"J. Scott Provan","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Scott Provan","raw_affiliation_strings":["University of North Carolina, Chapel Hill, North Carolina 25799-3180"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina, Chapel Hill, North Carolina 25799-3180","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035102045"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.4101,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.90698636,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"25","issue":"3","first_page":"101","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9995999932289124,"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.9995999932289124,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9908000230789185,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6229928135871887},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5938650965690613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.541243314743042},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5248389840126038},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.5070626735687256},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.48048320412635803},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.462100625038147},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4488051235675812},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4375420808792114},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42761728167533875},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4224892854690552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37500637769699097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30065634846687317},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22543641924858093}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6229928135871887},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5938650965690613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.541243314743042},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5248389840126038},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.5070626735687256},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.48048320412635803},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.462100625038147},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4488051235675812},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4375420808792114},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42761728167533875},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4224892854690552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37500637769699097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30065634846687317},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22543641924858093},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230250304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230250304","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:drum.lib.umd.edu:1903/5388","is_oa":false,"landing_page_url":"http://hdl.handle.net/1903/5388","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1979365494","https://openalex.org/W1998076865","https://openalex.org/W2025536390","https://openalex.org/W2034315530","https://openalex.org/W2036561027","https://openalex.org/W2115826669","https://openalex.org/W2125690626","https://openalex.org/W2147322117","https://openalex.org/W2159332695","https://openalex.org/W4234163381"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327","https://openalex.org/W4206407367","https://openalex.org/W3035974271"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"addresses":[3],"two":[4,29,39],"classes":[5],"of":[6,144,167],"reliability":[7],"analysis":[8],"models:":[9],"a":[10,15,35,50,105,153,159,171,176],"network":[11,45],"flow":[12,122],"model":[13,127],"and":[14,25,34,43,73,123],"project":[16,125],"scheduling":[17,126],"model.":[18],"In":[19,55],"each":[20],"model,":[21],"the":[22,44,63,68,71,83,93,110,113,117,121,139,142,146,149,165,185],"arcs":[23,151],"randomly":[24],"independently":[26],"take":[27],"on":[28,158],"possible":[30],"states\u2013an":[31],"\u201coperating\u201d":[32],"state":[33],"\u201cfailed\u201d":[36],"state\u2013corresponding":[37],"to":[38,48,103,141,191],"different":[40],"capacity/task\u2010time":[41],"values,":[42],"is":[46,59,77,96,128],"required":[47,118],"maintain":[49,116],"specified":[51],"\u201cthreshold\u201d":[52],"max\u2010flow/project\u2010completion\u2010time":[53],"value.":[54],"general,":[56],"this":[57],"problem":[58,143],"NP\u2010hard.":[60],"We":[61,181],"address":[62],"special":[64,87],"case":[65],"in":[66,82,130,152,170,178],"which":[67],"difference":[69],"between":[70],"lower":[72],"higher":[74],"arc":[75,81],"lengths":[76],"constant":[78],"for":[79,120,194],"every":[80],"network.":[84],"For":[85],"these":[86],"cases,":[88],"we":[89],"show":[90,183],"that":[91,112,148,164,179,196],"if":[92],"underlying":[94],"system":[95,114],"1\u2010":[97],"critical":[98],",":[99],"i.e.,":[100],"minimally":[101],"able":[102],"withstand":[104],"single":[106,160],"component":[107],"failure,":[108],"then":[109],"probability":[111,147],"can":[115,188],"threshold":[119],"planar":[124],"computable":[129],"polynomial":[131],"time.":[132],"Both":[133],"solutions":[134],"are":[135,197],"obtained":[136],"by":[137],"reducing":[138],"problems":[140],"determining":[145],"failed":[150,168],"directed":[154],"acyclic":[155],"graph":[156],"lie":[157],"path":[161],"or,":[162],"equivalently,":[163],"set":[166],"elements":[169],"given":[172],"partial":[173],"order":[174],"comprises":[175],"chain":[177],"order.":[180],"also":[182],"how":[184],"basic":[186],"approach":[187],"be":[189],"used":[190],"generate":[192],"bounds":[193],"systems":[195],"\u201calmost":[198],"critical\u201d.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}