{"id":"https://openalex.org/W1980532785","doi":"https://doi.org/10.1002/net.3230230604","title":"Finding all minimum\u2010size separating vertex sets in a graph","display_name":"Finding all minimum\u2010size separating vertex sets in a graph","publication_year":1993,"publication_date":"1993-09-01","ids":{"openalex":"https://openalex.org/W1980532785","doi":"https://doi.org/10.1002/net.3230230604","mag":"1980532785"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230230604","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230230604","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/A5052480740","display_name":"Arkady Kanevsky","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arkady Kanevsky","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, Texas 77843-3112","Department of Computer Science, Texas A&M University, College Station, Texas, 77843-3112#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, Texas 77843-3112","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, Texas, 77843-3112#TAB#","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052480740"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.517,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.60567537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"6","first_page":"533","last_page":"541"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"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.996999979019165,"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/vertex","display_name":"Vertex (graph theory)","score":0.6290354132652283},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6251630187034607},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5274674892425537},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5173353552818298},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4865643084049225},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3823448121547699},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3213152587413788}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6290354132652283},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6251630187034607},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5274674892425537},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5173353552818298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4865643084049225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3823448121547699},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3213152587413788}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230230604","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230230604","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:www.ideals.illinois.edu:2142/74264","is_oa":false,"landing_page_url":"https://www.ideals.illinois.edu/items/100443/bitstreams/320810/data.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401358","display_name":"Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801919071","host_organization_name":"University of Illinois System","host_organization_lineage":["https://openalex.org/I2801919071"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W237994133","https://openalex.org/W341093106","https://openalex.org/W976211528","https://openalex.org/W1513400187","https://openalex.org/W1531625822","https://openalex.org/W1536643806","https://openalex.org/W1595140484","https://openalex.org/W1967816223","https://openalex.org/W1981234161","https://openalex.org/W1994556169","https://openalex.org/W1995040285","https://openalex.org/W1996453957","https://openalex.org/W2001004241","https://openalex.org/W2004350101","https://openalex.org/W2008292658","https://openalex.org/W2022887970","https://openalex.org/W2028244023","https://openalex.org/W2035435951","https://openalex.org/W2042322483","https://openalex.org/W2045728010","https://openalex.org/W2061303458","https://openalex.org/W2089213868","https://openalex.org/W2090533339","https://openalex.org/W2098265073","https://openalex.org/W2101496488","https://openalex.org/W2106573360","https://openalex.org/W2118382442","https://openalex.org/W2121765622","https://openalex.org/W2132750992","https://openalex.org/W2159332695","https://openalex.org/W2395933225","https://openalex.org/W2610479830","https://openalex.org/W3022690009","https://openalex.org/W4213064273","https://openalex.org/W4234163381"],"related_works":["https://openalex.org/W2339534957","https://openalex.org/W1980648360","https://openalex.org/W2023302035","https://openalex.org/W2915580243","https://openalex.org/W3187836939","https://openalex.org/W2925142624","https://openalex.org/W2988282395","https://openalex.org/W2029571329","https://openalex.org/W341486533","https://openalex.org/W2557579792"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"present":[2],"a":[3,157],"new":[4],"algorithm":[5,28,107],"based":[6],"upon":[7],"network":[8],"flows":[9],"for":[10,108,168],"finding":[11],"all":[12],"minimum\u2010size":[13,50],"separating":[14,51],"vertex":[15,52],"sets":[16,53],"in":[17,30,64,74,116,126,172],"an":[18],"undirected":[19],"and":[20,84],"unweighted":[21],"graph.":[22],"The":[23,111],"sequential":[24],"implementation":[25,113],"of":[26,49,54,61,71,81,102,165],"our":[27],"runs":[29,114],"\u0398(":[31],"Mn":[32],"+":[33,92,140],"C":[34,85],")":[35,42,122,131,143,176],"=":[36,86,144],"O":[37,117,127,145,173],"(2":[38],"k":[39,77,89,119,147,152],"n":[40,57,93,121,130,138,149,175],"3":[41],"time,":[43],"where":[44,97,159],"M":[45,136],"is":[46,99,162],"the":[47,55,59,62,65,69,72,75,79,82,100,103,163],"number":[48,60,70,164],"graph;":[56,66,76],",":[58,68,78],"vertices":[63],"m":[67,91],"edges":[73],"connectivity":[80],"graph,":[83],"kn":[87],"min(":[88],"(":[90,118,148],"),":[94,96],"A":[95,98],"complexity":[101],"best":[104],"maximum":[105],"flow":[106],"unit":[109],"networks.":[110],"parallel":[112,169],"either":[115],"log":[120],"deterministic":[123],"time":[124,133,177],"or":[125],"(log":[128,174],"2":[129,137,139,153],"randomized":[132],"using":[134],"\u0398(;":[135],"knN":[141],"\u03b1":[142,161],"(4":[146],"6":[150],"/":[151],"))":[154],"processors":[155,166],"on":[156,178],"PRAM,":[158],"N":[160],"needed":[167],"matrix":[170],"multiplication":[171],"PRAM.":[179],"\u00a9":[180],"1993":[181],"by":[182],"John":[183],"Wiley":[184],"&":[185],"Sons,":[186],"Inc.":[187]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}