{"id":"https://openalex.org/W2147322117","doi":"https://doi.org/10.1137/0215050","title":"The Complexity of Reliability Computations in Planar and Acyclic Graphs","display_name":"The Complexity of Reliability Computations in Planar and Acyclic Graphs","publication_year":1986,"publication_date":"1986-08-01","ids":{"openalex":"https://openalex.org/W2147322117","doi":"https://doi.org/10.1137/0215050","mag":"2147322117"},"language":"en","primary_location":{"id":"doi:10.1137/0215050","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215050","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/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"]},{"id":"https://openalex.org/I4210158053","display_name":"University of North Carolina System","ror":"https://ror.org/0566a8c54","country_code":"US","type":"education","lineage":["https://openalex.org/I4210158053"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Scott Provan","raw_affiliation_strings":["Operations Research and Systems Analysis, University of North Carolina, Chapel Hill, North Carolina 27514"],"affiliations":[{"raw_affiliation_string":"Operations Research and Systems Analysis, University of North Carolina, Chapel Hill, North Carolina 27514","institution_ids":["https://openalex.org/I114027177","https://openalex.org/I4210158053"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005781105"],"corresponding_institution_ids":["https://openalex.org/I114027177","https://openalex.org/I4210158053"],"apc_list":null,"apc_paid":null,"fwci":3.3132,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.91712289,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"3","first_page":"694","last_page":"702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9976999759674072,"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/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.8408653140068054},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5623471140861511},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5343263745307922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.528822124004364},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5007998943328857},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4893445372581482},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4715210199356079},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4713434875011444},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.46735668182373047},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.44326645135879517},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3882251977920532},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3602288067340851},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35777372121810913},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.300266295671463},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29102951288223267}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.8408653140068054},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5623471140861511},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5343263745307922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.528822124004364},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5007998943328857},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4893445372581482},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4715210199356079},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4713434875011444},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.46735668182373047},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.44326645135879517},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3882251977920532},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3602288067340851},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35777372121810913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.300266295671463},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29102951288223267},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0215050","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215050","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:ADA150759","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&amp;verb=getRecord&amp;metadataPrefix=html&amp;identifier=ADA150759","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W112657017","https://openalex.org/W1998076865","https://openalex.org/W2017398159","https://openalex.org/W2020112047","https://openalex.org/W2023059211","https://openalex.org/W2029478301","https://openalex.org/W2074734391","https://openalex.org/W2087818742","https://openalex.org/W2089213868","https://openalex.org/W2112967464","https://openalex.org/W2115826669","https://openalex.org/W2146354455","https://openalex.org/W2159332695"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W4214487273","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W2783253555"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"the":[3,31,44],"problem":[4,34],"of":[5],"computing":[6],"source-sink":[7,21,32],"reliability":[8,33],"is":[9,35],"NP-hard,":[10],"in":[11],"fact":[12],"#":[13],"P-complete,":[14],"even":[15,42],"for":[16],"undirected":[17],"and":[18],"acyclic":[19],"directed":[20],"planar":[22],"graphs":[23],"having":[24],"vertex":[25],"degree":[26],"at":[27],"most":[28],"three.":[29],"Thus":[30],"unlikely":[36],"to":[37],"have":[38],"an":[39],"efficient":[40],"algorithm,":[41],"when":[43],"graph":[45],"can":[46],"be":[47],"laid":[48],"out":[49],"on":[50],"a":[51],"rectilinear":[52],"grid.":[53]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}
