{"id":"https://openalex.org/W4245681882","doi":"https://doi.org/10.1137/0214057","title":"A Linear-Time Algorithm for Computing <i>K</i>-Terminal Reliability in Series-Parallel Networks","display_name":"A Linear-Time Algorithm for Computing <i>K</i>-Terminal Reliability in Series-Parallel Networks","publication_year":1985,"publication_date":"1985-11-01","ids":{"openalex":"https://openalex.org/W4245681882","doi":"https://doi.org/10.1137/0214057"},"language":"en","primary_location":{"id":"doi:10.1137/0214057","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214057","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5043170226","display_name":"A. Satyanarayana","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. Satyanarayana","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5017144766","display_name":"R. Kevin Wood","orcid":"https://orcid.org/0000-0002-0311-8712"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Kevin Wood","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043170226"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1837,"has_fulltext":false,"cited_by_count":132,"citation_normalized_percentile":{"value":0.95380138,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"4","first_page":"818","last_page":"832"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9969000220298767,"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/combinatorics","display_name":"Combinatorics","score":0.6554913520812988},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5913870334625244},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5167168974876404},{"id":"https://openalex.org/keywords/series-and-parallel-circuits","display_name":"Series and parallel circuits","score":0.4744262099266052},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.4693259596824646},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4538203775882721},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44911161065101624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3444594144821167}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6554913520812988},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5913870334625244},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5167168974876404},{"id":"https://openalex.org/C95023266","wikidata":"https://www.wikidata.org/wiki/Q55738334","display_name":"Series and parallel circuits","level":3,"score":0.4744262099266052},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4693259596824646},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4538203775882721},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44911161065101624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3444594144821167},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/0214057","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214057","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1030.3244","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1030.3244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://calhoun.nps.edu/bitstream/handle/10945/38415/SatyanarayanWood1985.pdf?sequence%3D1","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.518.3559","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.518.3559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.nps.edu/kwood/docs/SatyanarayanWood1985.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1984078258","https://openalex.org/W1985495277","https://openalex.org/W2000615182","https://openalex.org/W2008013300","https://openalex.org/W2057084070","https://openalex.org/W2073840571","https://openalex.org/W2082191835","https://openalex.org/W2115826669","https://openalex.org/W2116804326","https://openalex.org/W2148011610","https://openalex.org/W2169717654"],"related_works":["https://openalex.org/W2091387920","https://openalex.org/W2487581613","https://openalex.org/W3196927449","https://openalex.org/W411258524","https://openalex.org/W2152893510","https://openalex.org/W1519201794","https://openalex.org/W1629505938","https://openalex.org/W2767824041","https://openalex.org/W2053667308","https://openalex.org/W1987322712"],"abstract_inverted_index":{"Let":[0],"$G":[1],"=":[2],"(V,E)$":[3],"be":[4,19,53,79],"a":[5,135,142],"graph":[6,143,164],"whose":[7],"edges":[8],"may":[9],"fail":[10],"with":[11],"known":[12,93],"probabilities":[13],"and":[14,137],"let":[15],"$K":[16],"\\subseteq":[17],"V$":[18],"specified.":[20],"The":[21],"K-terminal":[22],"reliability":[23,160],"of":[24,61,74,121,125,134,150,161,166],"G,":[25],"denoted":[26],"$R(G_K":[27,40,50,76,96,106],")$,":[28],"is":[29,108,128,155],"the":[30,72,114,132,159,167],"probability":[31],"that":[32,105],"all":[33,148],"vertices":[34,168],"in":[35,43,55,81,110,113,169],"K":[36],"are":[37,139],"connected.":[38],"Computing":[39],")$":[41,51,77,97,107],"is,":[42],"general,":[44],"NP-hard.":[45],"For":[46],"some":[47],"series-parallel":[48,68,101,163],"graphs,":[49,69],"can":[52],"computed":[54,80],"polynomial":[56,111],"time":[57,112],"by":[58],"repeated":[59],"application":[60],"well-known":[62],"reliability-preserving":[63,122],"reductions.":[64,146],"However,":[65],"for":[66,94,98,141,157],"other":[67],"depending":[70],"on":[71,89],"configuration":[73],"K,":[75],"cannot":[78],"this":[82],"way.":[83],"Only":[84],"exponential-time":[85],"algorithms":[86],"as":[87],"used":[88],"general":[90,126],"graphs":[91],"were":[92],"computing":[95,158],"these":[99],"\u201cirreducible\u201d":[100],"graphs.":[102],"We":[103],"prove":[104],"computable":[109],"irreducible":[115],"case,":[116],"too.":[117],"A":[118],"new":[119],"set":[120],"\u201cpolygon-to-chain\u201d":[123],"reductions":[124],"applicability":[127],"introduced":[129],"which":[130],"decreases":[131],"size":[133],"graph,":[136],"conditions":[138],"given":[140],"admitting":[144],"such":[145],"Combining":[147],"types":[149],"reductions,":[151],"an":[152],"$O(|E|)$":[153],"algorithm":[154],"presented":[156],"any":[162],"irrespective":[165],"K.":[170]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}