{"id":"https://openalex.org/W2050620052","doi":"https://doi.org/10.1137/0208051","title":"A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs","display_name":"A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs","publication_year":1979,"publication_date":"1979-11-01","ids":{"openalex":"https://openalex.org/W2050620052","doi":"https://doi.org/10.1137/0208051","mag":"2050620052"},"language":"en","primary_location":{"id":"doi:10.1137/0208051","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0208051","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/A5102762846","display_name":"Adi Shamir","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Adi Shamir","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102762846"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.595,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.63940256,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"8","issue":"4","first_page":"645","last_page":"655"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9994000196456909,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/flowchart","display_name":"Flowchart","score":0.6054872274398804},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.545400857925415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5219340324401855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4989802837371826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.417527973651886},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4067036509513855},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3979836702346802}],"concepts":[{"id":"https://openalex.org/C72041958","wikidata":"https://www.wikidata.org/wiki/Q185092","display_name":"Flowchart","level":2,"score":0.6054872274398804},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.545400857925415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5219340324401855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4989802837371826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.417527973651886},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4067036509513855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3979836702346802},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0208051","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0208051","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1986022261","https://openalex.org/W2023541076","https://openalex.org/W2118382442","https://openalex.org/W2146441023","https://openalex.org/W2401610261","https://openalex.org/W4251912342"],"related_works":["https://openalex.org/W2115906794","https://openalex.org/W2109215547","https://openalex.org/W1992202691","https://openalex.org/W2131878319","https://openalex.org/W2323840003","https://openalex.org/W2188108885","https://openalex.org/W1519201794","https://openalex.org/W1629505938","https://openalex.org/W2767824041","https://openalex.org/W1987322712"],"abstract_inverted_index":{"The":[0],"analysis":[1],"of":[2,12,15,28,44,74,104,118],"many":[3],"processes":[4],"modeled":[5],"by":[6],"directed":[7,50],"graphs":[8,51,65],"requires":[9],"the":[10,20,23,26,42,71,88,102],"selection":[11],"a":[13,30,35,97],"subset":[14],"vertices":[16],"which":[17],"cut":[18],"all":[19,70],"cycles":[21],"in":[22,48,63,68,81,122],"graph.":[24],"Reducing":[25],"size":[27],"such":[29],"cutset":[31],"usually":[32],"leads":[33],"to":[34,54,96],"simpler":[36],"and":[37],"more":[38],"efficient":[39],"analysis,":[40],"but":[41],"problem":[43],"finding":[45],"minimum":[46,76],"cutsets":[47,77],"general":[49],"is":[52,111,121],"known":[53],"be":[55,79],"$NP$-complete.":[56],"In":[57],"this":[58,119],"paper":[59],"we":[60],"show":[61,86],"that":[62,87],"reducible":[64,112],"(and":[66],"thus":[67,100],"almost":[69],"\u201cpractical\u201d":[72],"flowcharts":[73],"programs),":[75],"can":[78,91],"found":[80],"linear":[82,89],"time.":[83],"We":[84],"further":[85],"algorithm":[90],"check":[92],"its":[93],"own":[94],"applicability":[95],"given":[98],"graph,":[99],"eliminating":[101],"need":[103],"prechecking":[105],"(in":[106],"nonlinear":[107],"time)":[108],"whether":[109],"it":[110],"or":[113],"not.":[114],"An":[115],"immediate":[116],"application":[117],"result":[120],"program":[123],"verification":[124],"systems":[125],"based":[126],"on":[127],"Floyd\u2019s":[128],"inductive":[129],"assertions":[130],"method.":[131]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}