{"id":"https://openalex.org/W7167734926","doi":"https://doi.org/10.48550/arxiv.2607.05751","title":"On the Communication Complexity of Maximum Matching and Negative-Weight Shortest Paths","display_name":"On the Communication Complexity of Maximum Matching and Negative-Weight Shortest Paths","publication_year":2026,"publication_date":"2026-07-07","ids":{"openalex":"https://openalex.org/W7167734926","doi":"https://doi.org/10.48550/arxiv.2607.05751"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.05751","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.05751","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.05751","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080075813","display_name":"Yu Cheng","orcid":"https://orcid.org/0009-0005-3128-5613"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cheng, Yu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108987342","display_name":"Tianle Jiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Tianle","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5098402066","display_name":"Pachara Sawettamalya","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sawettamalya, Pachara","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140241656","display_name":"Huacheng Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Huacheng","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.737500011920929,"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.737500011920929,"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.18070000410079956,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.020099999383091927,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5680999755859375},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5142999887466431},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5081999897956848},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43050000071525574},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4066999852657318},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.4018999934196472},{"id":"https://openalex.org/keywords/communications-protocol","display_name":"Communications protocol","score":0.39980000257492065},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3840999901294708}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5680999755859375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5468999743461609},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.541100025177002},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5142999887466431},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5081999897956848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45019999146461487},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43050000071525574},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4066999852657318},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.4018999934196472},{"id":"https://openalex.org/C12269588","wikidata":"https://www.wikidata.org/wiki/Q132364","display_name":"Communications protocol","level":2,"score":0.39980000257492065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3885999917984009},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3840999901294708},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.34279999136924744},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3402999937534332},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.2702000141143799},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2605000138282776}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.05751","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.05751","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.05751","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.05751","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,140],"revisit":[1],"several":[2,136],"fundamental":[3],"graph":[4,138,156],"problems":[5],"in":[6,26,111],"the":[7,30,39,53,117,148],"deterministic":[8],"two-party":[9],"communication":[10,119,149],"model.":[11],"Our":[12,77],"main":[13],"contributions":[14],"include:":[15],"(1)":[16],"a":[17,23,57,65,87,93,102,108,126,152],"new":[18,66],"$\\widetilde{O}(n^{3/2})$-bit":[19],"protocol":[20,47,68,78,105,120],"for":[21,69,106,135],"computing":[22,107],"maximum":[24,109],"matching":[25,110],"general":[27],"graphs.":[28],"While":[29],"same":[31],"upper":[32],"bound":[33],"can":[34],"be":[35],"obtained":[36,114],"by":[37,85,115],"simulating":[38],"classic":[40],"algorithms":[41],"of":[42,55,60,81,90,121,151,155],"Micali-Vazirani":[43],"and":[44,51,72],"Gabow,":[45],"our":[46],"is":[48],"conceptually":[49],"simple":[50],"avoids":[52],"intricacies":[54],"finding":[56],"maximal":[58],"set":[59],"shortest":[61,75],"augmenting":[62],"paths;":[63],"(2)":[64],"$\\widetilde{O}(n)$-bit":[67,104],"negative-cycle":[70],"detection":[71],"negative-weight":[73],"single-source":[74],"paths.":[76],"simplifies":[79],"that":[80],"Blikstad":[82,122],"et":[83,123],"al.":[84,124],"replacing":[86],"long":[88],"chain":[89],"reductions":[91],"with":[92],"more":[94],"direct":[95],"approach":[96],"based":[97],"on":[98,147],"vertex":[99],"potentials;":[100],"(3)":[101],"combinatorial":[103],"bipartite":[112],"graphs,":[113],"reinterpreting":[116],"near-linear":[118],"through":[125],"discretized":[127],"analysis.":[128],"Together,":[129],"these":[130],"results":[131],"provide":[132],"simpler":[133],"protocols":[134],"basic":[137],"problems.":[139,157],"hope":[141],"they":[142],"will":[143],"inspire":[144],"further":[145],"advances":[146],"complexity":[150],"wide":[153],"range":[154]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-09T00:00:00"}