{"id":"https://openalex.org/W2170275891","doi":"https://doi.org/10.1002/net.3230220405","title":"Algorithms for K\u2010terminal reliability problems with node failures","display_name":"Algorithms for K\u2010terminal reliability problems with node failures","publication_year":1992,"publication_date":"1992-07-01","ids":{"openalex":"https://openalex.org/W2170275891","doi":"https://doi.org/10.1002/net.3230220405","mag":"2170275891"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220405","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/A5059304834","display_name":"Ehab S. Elmallah","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Ehab S. Elmallah","raw_affiliation_strings":["Department of Computing Science University of Alberta Edmonton, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science University of Alberta Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059304834"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.9815,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.80810296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"22","issue":"4","first_page":"369","last_page":"384"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6221999526023865},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4606689214706421},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44623878598213196},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4006240963935852},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3558109700679779},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3231339454650879}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6221999526023865},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4606689214706421},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44623878598213196},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4006240963935852},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3558109700679779},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3231339454650879}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/net.3230220405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220405","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:CiteSeerX.psu:10.1.1.53.9838","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.9838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://menaik.cs.ualberta.ca/pub/ehab/papers/91.kpnf/main.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.52","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.52","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ftp.cs.ualberta.ca/~ehab/src/online/elmallah-k-terminal-networks-92.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1971604681","https://openalex.org/W1980331282","https://openalex.org/W1998076865","https://openalex.org/W2029478301","https://openalex.org/W2062420832","https://openalex.org/W2063549430","https://openalex.org/W2066629848","https://openalex.org/W2093187872","https://openalex.org/W2115826669","https://openalex.org/W2117889403","https://openalex.org/W2147322117","https://openalex.org/W6643252373"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"Abstract":[0],"Consider":[1],"a":[2,7,18,32,130,140,162,167],"distributed":[3],"processing":[4],"system":[5,28],"with":[6,35,65],"set":[8],"K":[9,62,82],"of":[10,59,115,126,156],"sites":[11,60,80],"that":[12,55,92,145],"can":[13,63],"either":[14],"cooperate":[15],"in":[16,51,61,81,96,129],"computing":[17,52],"function":[19],"or":[20],"hold":[21],"resources":[22],"required":[23],"by":[24],"other":[25],"sites.":[26],"The":[27],"is":[29,70,89,99,139,159],"implemented":[30],"using":[31],"communication":[33],"network":[34,98,158],"unreliable":[36],"nodes.":[37],"Two":[38],"simplified":[39],"reliability":[40,87],"problems":[41,147],"then":[42],"arise.":[43],"In":[44,75,108],"the":[45,53,76,79,90,97,113,123,153,157],"first":[46],"problem,":[47,78],"we":[48,111],"are":[49,83],"interested":[50],"probability":[54,91],"every":[56,93],"operational":[57,94,105],"pair":[58],"communicate":[64],"each":[66],"other.":[67],"This":[68],"problem":[69],"known":[71],"to":[72,101,161],"be":[73],"#P\u2010complete.":[74],"second":[77],"service":[84,106],"centers.":[85],"Our":[86],"measure":[88],"site":[95],"connected":[100],"at":[102],"least":[103],"one":[104],"center.":[107],"this":[109],"paper,":[110],"define":[112],"class":[114],"t":[116,119,132,136,163,169],"\u2010polygon":[117,137,164],"graphs,":[118],"\u2265":[120],"3,":[121],"as":[122],"intersection":[124],"graphs":[125],"straight\u2010line":[127],"chords":[128],"convex":[131],"\u2010gon.":[133],"Hence,":[134],"any":[135],"graph":[138,155],"circle":[141],"graph.":[142],"We":[143],"show":[144],"both":[146],"admit":[148],"polynomial":[149],"time":[150],"solutions":[151],"when":[152],"underlying":[154],"restricted":[160],"graph,":[165],"for":[166],"fixed":[168],".":[170]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}