{"id":"https://openalex.org/W2793058913","doi":"https://doi.org/10.1145/3212734.3212737","title":"Round- and Message-Optimal Distributed Graph Algorithms","display_name":"Round- and Message-Optimal Distributed Graph Algorithms","publication_year":2018,"publication_date":"2018-07-23","ids":{"openalex":"https://openalex.org/W2793058913","doi":"https://doi.org/10.1145/3212734.3212737","mag":"2793058913"},"language":"en","primary_location":{"id":"doi:10.1145/3212734.3212737","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3212734.3212737","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3212734.3212737","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed 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/3212734.3212737","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021573603","display_name":"D Ellis Hershkowitz","orcid":"https://orcid.org/0000-0003-0862-3715"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Ellis Hershkowitz","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033052575","display_name":"David Wajc","orcid":"https://orcid.org/0000-0003-1896-2948"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Wajc","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080591933"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":5.1289,"has_fulltext":true,"cited_by_count":35,"citation_normalized_percentile":{"value":0.96141611,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"119","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/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.9998000264167786,"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/computer-science","display_name":"Computer science","score":0.7726569771766663},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6126331090927124},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5927059650421143},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5763461589813232},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.5627200603485107},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5110658407211304},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4822850525379181},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4579564034938812},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4139249920845032},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4031374454498291},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2543271780014038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19190126657485962},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.132756769657135}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7726569771766663},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6126331090927124},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5927059650421143},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5763461589813232},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.5627200603485107},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5110658407211304},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4822850525379181},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4579564034938812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4139249920845032},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4031374454498291},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2543271780014038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19190126657485962},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.132756769657135}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3212734.3212737","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3212734.3212737","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3212734.3212737","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3212734.3212737","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3212734.3212737","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3212734.3212737","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1207254948","display_name":null,"funder_award_id":"NSF Career award CCF-1750808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G142137482","display_name":"CAREER: A Theory of Error Correction for Interactive Communication","funder_award_id":"1750808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3080285106","display_name":null,"funder_award_id":"CAREER award CCF-1750808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4810324284","display_name":null,"funder_award_id":"CCF-1750808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5454242832","display_name":"CCF-BSF: AF: Small: Coding for Distributed Computing","funder_award_id":"1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7313931465","display_name":null,"funder_award_id":"CCF-1527110, CCF-1618280 and NSF CAREER award CCF-1750808","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7442669385","display_name":null,"funder_award_id":"CCF-1527110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7659139977","display_name":null,"funder_award_id":"CCF-1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8950406855","display_name":null,"funder_award_id":"CCF-1527110, CCF-1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8991894024","display_name":"AF: Small: Distributed Algorithms for Near-Planar Networks","funder_award_id":"1527110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2793058913.pdf","grobid_xml":"https://content.openalex.org/works/W2793058913.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W37512724","https://openalex.org/W1497938971","https://openalex.org/W1508113861","https://openalex.org/W1568961751","https://openalex.org/W1582638066","https://openalex.org/W1587504556","https://openalex.org/W1976485065","https://openalex.org/W1984090926","https://openalex.org/W2000695296","https://openalex.org/W2005900781","https://openalex.org/W2015819397","https://openalex.org/W2018804864","https://openalex.org/W2030982625","https://openalex.org/W2040011014","https://openalex.org/W2040273581","https://openalex.org/W2042437235","https://openalex.org/W2048098617","https://openalex.org/W2053788000","https://openalex.org/W2053981136","https://openalex.org/W2067661972","https://openalex.org/W2071346873","https://openalex.org/W2077371116","https://openalex.org/W2083323175","https://openalex.org/W2100466311","https://openalex.org/W2107282727","https://openalex.org/W2116055396","https://openalex.org/W2136425424","https://openalex.org/W2163097371","https://openalex.org/W2294674552","https://openalex.org/W2484918492","https://openalex.org/W2515165863","https://openalex.org/W2569211293","https://openalex.org/W2592535728","https://openalex.org/W2784498202","https://openalex.org/W2793058913","https://openalex.org/W2952482095","https://openalex.org/W2962991864","https://openalex.org/W2963420932","https://openalex.org/W3104014862","https://openalex.org/W4205300528","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W8653221","https://openalex.org/W4297934114","https://openalex.org/W3067869622"],"abstract_inverted_index":{"Distributed":[0],"graph":[1],"algorithms":[2,25],"that":[3,44],"separately":[4],"optimize":[5],"for":[6,45],"either":[7],"the":[8,14,67],"number":[9,16],"of":[10,17,70],"rounds":[11],"used":[12],"or":[13],"total":[15],"messages":[18],"sent":[19],"have":[20,33],"been":[21,34],"studied":[22],"extensively.":[23],"However,":[24],"simultaneously":[26],"efficient":[27],"with":[28],"respect":[29],"to":[30,59],"both":[31],"measures":[32],"elusive.":[35],"For":[36],"example,":[37],"only":[38],"very":[39],"recently":[40],"was":[41],"it":[42],"shown":[43],"Minimum":[46],"Spanning":[47],"Tree":[48],"(MST),":[49],"an":[50],"optimal":[51],"message":[52],"and":[53],"round":[54],"complexity":[55],"is":[56],"achievable":[57],"(up":[58],"polylog":[60],"terms)":[61],"by":[62],"a":[63],"single":[64],"algorithm":[65],"in":[66],"CONGEST":[68],"model":[69],"communication.":[71]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}