{"id":"https://openalex.org/W1998076865","doi":"https://doi.org/10.1137/0212053","title":"The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected","display_name":"The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected","publication_year":1983,"publication_date":"1983-11-01","ids":{"openalex":"https://openalex.org/W1998076865","doi":"https://doi.org/10.1137/0212053","mag":"1998076865"},"language":"en","primary_location":{"id":"doi:10.1137/0212053","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0212053","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":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Scott Provan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5035102045","display_name":"Michael O. Ball","orcid":"https://orcid.org/0000-0003-2757-8569"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael O. Ball","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":61.2177,"has_fulltext":false,"cited_by_count":754,"citation_normalized_percentile":{"value":0.99966865,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"12","issue":"4","first_page":"777","last_page":"788"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9997000098228455,"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.9997000098228455,"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.9848999977111816,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9746000170707703,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7206515073776245},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.7028563618659973},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6826127767562866},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.6389496922492981},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6265736818313599},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5401211977005005},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5326957702636719},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.45906808972358704},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45844268798828125},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4579642415046692},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.42473727464675903},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2361365556716919}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7206515073776245},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7028563618659973},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6826127767562866},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.6389496922492981},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6265736818313599},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5401211977005005},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5326957702636719},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.45906808972358704},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45844268798828125},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4579642415046692},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.42473727464675903},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2361365556716919},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0212053","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0212053","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1980331282","https://openalex.org/W1986934618","https://openalex.org/W2029478301","https://openalex.org/W2029673229","https://openalex.org/W2089213868","https://openalex.org/W2115826669","https://openalex.org/W2159332695","https://openalex.org/W2323576400"],"related_works":["https://openalex.org/W2248869909","https://openalex.org/W938372727","https://openalex.org/W4283803707","https://openalex.org/W2153120082","https://openalex.org/W2104770429","https://openalex.org/W4379118151","https://openalex.org/W4286905290","https://openalex.org/W2515644193","https://openalex.org/W4363672051","https://openalex.org/W4319452415"],"abstract_inverted_index":{"Several":[0],"enumeration":[1],"and":[2,11,37,69,78],"reliability":[3,26],"problems":[4,23],"are":[5,21,55],"shown":[6,50],"to":[7,51],"be":[8,52],"#":[9,53],"P-complete,":[10],"hence,":[12],"at":[13],"least":[14],"as":[15,17],"hard":[16],"NP-complete":[18],"problems.":[19],"Included":[20],"important":[22],"in":[24,59,65],"network":[25,47],"analysis,":[27],"namely,":[28],"computing":[29],"the":[30,39,71,79],"probability":[31,72,80],"that":[32,73,81],"a":[33,60,66,74,82],"graph":[34,75],"is":[35,76,86],"connected":[36,77],"counting":[38,56,63],"number":[40],"of":[41,84],"minimum":[42],"cardinality":[43],"$(s,t)$-cuts":[44],"or":[45],"directed":[46],"cuts.":[48],"Also":[49],"P-complete":[54],"vertex":[57],"covers":[58],"bipartite":[61],"graph,":[62],"antichains":[64],"partial":[67],"order,":[68],"approximating":[70],"pair":[83],"vertices":[85],"connected.":[87]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":22},{"year":2022,"cited_by_count":27},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":32},{"year":2019,"cited_by_count":26},{"year":2018,"cited_by_count":28},{"year":2017,"cited_by_count":29},{"year":2016,"cited_by_count":30},{"year":2015,"cited_by_count":26},{"year":2014,"cited_by_count":41},{"year":2013,"cited_by_count":26},{"year":2012,"cited_by_count":27}],"updated_date":"2026-07-04T07:58:01.006859","created_date":"2025-10-10T00:00:00"}