{"id":"https://openalex.org/W4376639552","doi":"https://doi.org/10.1145/3564246.3585201","title":"Finding a Small Vertex Cut on Distributed Networks","display_name":"Finding a Small Vertex Cut on Distributed Networks","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639552","doi":"https://doi.org/10.1145/3564246.3585201"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585201","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585201","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585201","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585201","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031660185","display_name":"Yonggang Jiang","orcid":"https://orcid.org/0000-0003-1979-996X"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Yonggang Jiang","raw_affiliation_strings":["MPI-INF, Germany / Saarland University, Germany"],"affiliations":[{"raw_affiliation_string":"MPI-INF, Germany / Saarland University, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050217636","display_name":"Sagnik Mukhopadhyay","orcid":"https://orcid.org/0000-0002-3722-4679"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sagnik Mukhopadhyay","raw_affiliation_strings":["University of Sheffield, UK"],"affiliations":[{"raw_affiliation_string":"University of Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031660185"],"corresponding_institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":0.6061,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70135777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1791","last_page":"1801"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T10237","display_name":"Cryptography and Data Security","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7201430797576904},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6602192521095276},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4872216284275055},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4844241440296173},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.46633124351501465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40978533029556274},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3905952572822571},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14706581830978394},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1447899341583252}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7201430797576904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6602192521095276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4872216284275055},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4844241440296173},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.46633124351501465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40978533029556274},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3905952572822571},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14706581830978394},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1447899341583252},{"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.1145/3564246.3585201","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585201","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585201","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585201","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585201","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585201","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4376639552.pdf"},"referenced_works_count":63,"referenced_works":["https://openalex.org/W1497938971","https://openalex.org/W1508113861","https://openalex.org/W1534484868","https://openalex.org/W1861736669","https://openalex.org/W1964510837","https://openalex.org/W1974912205","https://openalex.org/W1975832752","https://openalex.org/W1994556169","https://openalex.org/W1996575062","https://openalex.org/W2001004241","https://openalex.org/W2008292658","https://openalex.org/W2012310530","https://openalex.org/W2015819397","https://openalex.org/W2016124646","https://openalex.org/W2026798971","https://openalex.org/W2030982625","https://openalex.org/W2035228443","https://openalex.org/W2040011014","https://openalex.org/W2050021819","https://openalex.org/W2055314845","https://openalex.org/W2064493067","https://openalex.org/W2083323175","https://openalex.org/W2111332454","https://openalex.org/W2112702616","https://openalex.org/W2116055396","https://openalex.org/W2118382442","https://openalex.org/W2121765622","https://openalex.org/W2121852952","https://openalex.org/W2132877659","https://openalex.org/W2135512436","https://openalex.org/W2153507546","https://openalex.org/W2163097371","https://openalex.org/W2565540516","https://openalex.org/W2571471359","https://openalex.org/W2803918337","https://openalex.org/W2937529321","https://openalex.org/W2952895509","https://openalex.org/W2963355678","https://openalex.org/W2963612177","https://openalex.org/W2963654823","https://openalex.org/W2963948050","https://openalex.org/W2964010100","https://openalex.org/W2972207998","https://openalex.org/W2981949299","https://openalex.org/W2983782154","https://openalex.org/W2998970133","https://openalex.org/W3000986974","https://openalex.org/W3033793834","https://openalex.org/W3035645591","https://openalex.org/W3042984089","https://openalex.org/W3101974321","https://openalex.org/W3102961801","https://openalex.org/W3129188913","https://openalex.org/W3166491318","https://openalex.org/W3168134475","https://openalex.org/W3170201847","https://openalex.org/W3171180074","https://openalex.org/W4225983347","https://openalex.org/W4230894037","https://openalex.org/W4288091431","https://openalex.org/W4288124320","https://openalex.org/W4300142023","https://openalex.org/W4303414383"],"related_works":["https://openalex.org/W2301742412","https://openalex.org/W2085917070","https://openalex.org/W1972245899","https://openalex.org/W2056956565","https://openalex.org/W4313160393","https://openalex.org/W1998185014","https://openalex.org/W2952590198","https://openalex.org/W2783631410","https://openalex.org/W2002340571","https://openalex.org/W2184626999"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"algorithm":[3,24,48],"for":[4],"distributed":[5],"networks":[6],"to":[7],"efficiently":[8],"find":[9,30],"a":[10,19],"small":[11],"vertex":[12],"cut":[13],"in":[14,60],"the":[15,36,56,61,66],"CONGEST":[16],"model.":[17],"Given":[18],"positive":[20],"integer":[21],"\u03ba,":[22],"our":[23],"can,":[25],"with":[26],"high":[27],"probability,":[28],"either":[29],"\u03ba":[31,42],"vertices":[32,43,59],"whose":[33],"removal":[34],"disconnects":[35],"network":[37,62],"or":[38],"return":[39],"that":[40],"such":[41],"do":[44],"not":[45],"exist.":[46],"Our":[47],"takes":[49],"\u03ba3\u00b7":[50],"\u00d5(D+\u221an)":[51,71],"rounds,":[52],"where":[53],"n":[54],"is":[55],"number":[57],"of":[58],"and":[63],"D":[64],"denotes":[65],"network\u2019s":[67],"diameter.":[68],"This":[69],"implies":[70],"round":[72],"complexity":[73],"whenever":[74],"\u03ba=polylog(n).":[75]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-24T23:09:58.560324","created_date":"2025-10-10T00:00:00"}