{"id":"https://openalex.org/W4411319842","doi":"https://doi.org/10.1145/3717823.3718316","title":"Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations","display_name":"Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations","publication_year":2025,"publication_date":"2025-06-15","ids":{"openalex":"https://openalex.org/W4411319842","doi":"https://doi.org/10.1145/3717823.3718316"},"language":"en","primary_location":{"id":"doi:10.1145/3717823.3718316","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718316","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ir.cwi.nl/pub/35855/35855.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081781976","display_name":"Joakim Blikstad","orcid":"https://orcid.org/0009-0004-0874-2356"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["NL","SE"],"is_corresponding":false,"raw_author_name":"Joakim Blikstad","raw_affiliation_strings":["CWI, Amsterdam, Netherlands","KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0009-0004-0874-2356","affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078841362","display_name":"Yonggang Jiang","orcid":"https://orcid.org/0009-0002-8485-6676"},"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":false,"raw_author_name":"Yonggang Jiang","raw_affiliation_strings":["MPI-INF, Saarbr\u00fccken, Germany","Saarland University, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0009-0002-8485-6676","affiliations":[{"raw_affiliation_string":"MPI-INF, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050217636","display_name":"Sagnik Mukhopadhyay","orcid":"https://orcid.org/0000-0002-3722-4679"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sagnik Mukhopadhyay","raw_affiliation_strings":["University of Birmingham, Birmingham, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-3722-4679","affiliations":[{"raw_affiliation_string":"University of Birmingham, Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068060092","display_name":"Sorrachai Yingchareonthawornchai","orcid":"https://orcid.org/0000-0002-7169-0163"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]},{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH","IL"],"is_corresponding":false,"raw_author_name":"Sorrachai Yingchareonthawornchai","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland","Hebrew University of Jerusalem, Jerusalem, Israel"],"raw_orcid":"https://orcid.org/0000-0002-7169-0163","affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Hebrew University of Jerusalem, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":6,"institutions_distinct_count":7,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9197,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.77621757,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2305","last_page":"2316"},"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.9994999766349792,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9976999759674072,"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.513843834400177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5129541754722595},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4149773418903351},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3405076861381531},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3302745819091797},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.22164112329483032}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.513843834400177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5129541754722595},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4149773418903351},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3405076861381531},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3302745819091797},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22164112329483032}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3717823.3718316","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718316","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:cwi.nl:35855","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/35855","pdf_url":"https://ir.cwi.nl/pub/35855/35855.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/2a9cbd5e-6b69-4e67-a443-839df271fb69","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/2a9cbd5e-6b69-4e67-a443-839df271fb69","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Blikstad, J, Jiang, Y, Mukhopadhyay, S & Yingchareonthawornchai, S 2025, Global vs. s-t Vertex Connectivity Beyond Sequential : Almost-Perfect Reductions and Near-Optimal Separations. in M Koucky & N Bansal (eds), STOC '25 : Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 2305-2316, 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czech Republic, 23/06/25. https://doi.org/10.1145/3717823.3718316","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:cwi.nl:35855","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/35855","pdf_url":"https://ir.cwi.nl/pub/35855/35855.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3486575691","display_name":"Novel Algorithmic Techniques through the Lens of Combinatorics","funder_award_id":"759557","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8493041814","display_name":"The Complexity of Dynamic Matrix Problems","funder_award_id":"101039914","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321652","display_name":"Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich","ror":"https://ror.org/05a28rw58"},{"id":"https://openalex.org/F4320327714","display_name":"ETH Z\u00fcrich Foundation","ror":null},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411319842.pdf","grobid_xml":"https://content.openalex.org/works/W4411319842.grobid-xml"},"referenced_works_count":74,"referenced_works":["https://openalex.org/W161718775","https://openalex.org/W1447961680","https://openalex.org/W1510700297","https://openalex.org/W1717586443","https://openalex.org/W1964510837","https://openalex.org/W1967311985","https://openalex.org/W1974912205","https://openalex.org/W1975832752","https://openalex.org/W1977741646","https://openalex.org/W1996575062","https://openalex.org/W2001004241","https://openalex.org/W2008292658","https://openalex.org/W2016124646","https://openalex.org/W2035315311","https://openalex.org/W2035435951","https://openalex.org/W2038708787","https://openalex.org/W2040699536","https://openalex.org/W2045107949","https://openalex.org/W2055314845","https://openalex.org/W2064306958","https://openalex.org/W2075459377","https://openalex.org/W2078960854","https://openalex.org/W2084990336","https://openalex.org/W2088263428","https://openalex.org/W2111332454","https://openalex.org/W2121765622","https://openalex.org/W2132877659","https://openalex.org/W2140097884","https://openalex.org/W2153507546","https://openalex.org/W2186715137","https://openalex.org/W2245672739","https://openalex.org/W2561675875","https://openalex.org/W2610479830","https://openalex.org/W2610729871","https://openalex.org/W2624960300","https://openalex.org/W2896802580","https://openalex.org/W2935819705","https://openalex.org/W2944717612","https://openalex.org/W2945481216","https://openalex.org/W2983782154","https://openalex.org/W2988480584","https://openalex.org/W3010117538","https://openalex.org/W3030774092","https://openalex.org/W3039967246","https://openalex.org/W3046086623","https://openalex.org/W3081561662","https://openalex.org/W3082293883","https://openalex.org/W3118481865","https://openalex.org/W3120953703","https://openalex.org/W3133097631","https://openalex.org/W3145007184","https://openalex.org/W3150861763","https://openalex.org/W3181145973","https://openalex.org/W4224930729","https://openalex.org/W4226310359","https://openalex.org/W4240901955","https://openalex.org/W4281710856","https://openalex.org/W4281778715","https://openalex.org/W4290058549","https://openalex.org/W4307416302","https://openalex.org/W4308756996","https://openalex.org/W4309395207","https://openalex.org/W4316652336","https://openalex.org/W4406142101","https://openalex.org/W4412481717","https://openalex.org/W6658214496","https://openalex.org/W6668193952","https://openalex.org/W6682118299","https://openalex.org/W6776103432","https://openalex.org/W6790449121","https://openalex.org/W6791946890","https://openalex.org/W6850044876","https://openalex.org/W6868866184","https://openalex.org/W6891314718"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W3111310291"],"abstract_inverted_index":{"A":[0],"recent":[1],"breakthrough":[2],"by":[3,101,187,232],"[LNPSY":[4],"STOC'21]":[5],"showed":[6],"that":[7,51,147,220],"solving":[8],"s-t":[9,37,57,78,155,169,229,235],"vertex":[10,21,40,79,92,126,149,156,222,230],"connectivity":[11,22,41,127,150,157,223,231],"is":[12,33,106,113,132,151,200],"sufficient":[13],"(up":[14],"to":[15,18,77,85,173,236],"polylogarithmic":[16],"factors)":[17],"solve":[19],"(global)":[20],"in":[23,42,140,158,176,214,239,242],"the":[24,34,52,96,107,114,120,123,130,159,195,243],"sequential":[25],"model.":[26],"This":[27,135],"raises":[28],"a":[29,86,201],"natural":[30],"question:":[31],"What":[32],"relationship":[35],"between":[36,54],"and":[38,56,67,88,111,245],"global":[39,55,76,148,221,237],"other":[43],"computational":[44,63],"models?":[45],"In":[46,65,81,118,143],"this":[47,83],"paper,":[48],"we":[49,70,145,206,218],"demonstrate":[50],"connection":[53],"variants":[58],"behaves":[59],"very":[60],"differently":[61],"across":[62],"models.":[64,216,247],"parallel":[66],"distributed":[68],"models,":[69],"obtain":[71],"almost":[72],"tight":[73],"reductions":[74],"from":[75],"connectivity.":[80],"PRAM,":[82],"leads":[84],"$n^{\u03c9+o(1)}$-work":[87],"$n^{o(1)}$-depth":[89],"algorithm":[90,100,128],"for":[91],"connectivity,":[93],"improving":[94],"over":[95],"35-year-old":[97],"$\u00d5(n^{\u03c9+1})$-work":[98],"$O(\\mathrm{log}^2n)$-depth":[99],"[LLW":[102],"FOCS'86],":[103],"where":[104],"$\u03c9$":[105],"matrix":[108],"multiplication":[109],"exponent":[110],"$n$":[112],"number":[115],"of":[116,166,197],"vertices.":[117],"CONGEST,":[119],"reduction":[121,238],"implies":[122],"first":[124],"sublinear-round":[125],"when":[129],"diameter":[131],"moderately":[133],"small.":[134],"answers":[136],"an":[137,234],"open":[138,184],"question":[139],"[JM":[141],"STOC'23].":[142],"contrast,":[144],"show":[146],"strictly":[152],"harder":[153],"than":[154],"two-party":[160],"communication":[161,178,246],"setting,":[162],"requiring":[163],"$n^{1.5}$":[164],"bits":[165],"communication.":[167],"The":[168],"variant":[170],"was":[171],"known":[172],"be":[174,212,225],"solvable":[175],"$\u00d5(n)$":[177],"[BvdBEMN":[179],"FOCS'22].":[180],"Our":[181],"results":[182,199],"resolve":[183],"problems":[185],"raised":[186],"[MN":[188],"STOC'20,":[189],"BvdBEMN":[190],"FOCS'22,":[191],"AS":[192],"SOSA'23].":[193],"At":[194],"heart":[196],"our":[198],"new":[202],"graph":[203],"decomposition":[204],"framework":[205],"call":[207],"common-neighborhood":[208],"clustering,":[209],"which":[210],"can":[211],"applied":[213],"multiple":[215],"Finally,":[217],"observe":[219],"cannot":[224],"solved":[226],"without":[227],"using":[228],"proving":[233],"dense":[240],"graphs":[241],"PRAM":[244]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}