{"id":"https://openalex.org/W2807720788","doi":"https://doi.org/10.1145/3209689","title":"Fast Distributed Algorithms for Connectivity and MST in Large Graphs","display_name":"Fast Distributed Algorithms for Connectivity and MST in Large Graphs","publication_year":2018,"publication_date":"2018-03-31","ids":{"openalex":"https://openalex.org/W2807720788","doi":"https://doi.org/10.1145/3209689","mag":"2807720788"},"language":"en","primary_location":{"id":"doi:10.1145/3209689","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3209689","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3209689","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3209689","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089574654","display_name":"Gopal Pandurangan","orcid":"https://orcid.org/0000-0001-5833-6592"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gopal Pandurangan","raw_affiliation_strings":["University of Houston, Houston, TX, USA"],"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103150417","display_name":"Peter Robinson","orcid":"https://orcid.org/0000-0002-7442-7002"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Peter Robinson","raw_affiliation_strings":["Royal Holloway, University of London"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072734392","display_name":"Michele Scquizzato","orcid":"https://orcid.org/0000-0002-9108-2448"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michele Scquizzato","raw_affiliation_strings":["University of Houston"],"affiliations":[{"raw_affiliation_string":"University of Houston","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089574654"],"corresponding_institution_ids":["https://openalex.org/I44461941"],"apc_list":null,"apc_paid":null,"fwci":1.9236,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.87593563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"5","issue":"1","first_page":"1","last_page":"22"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5189716219902039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.51618891954422},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5004012584686279},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49497169256210327},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48438674211502075},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4795522391796112},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.47701096534729004},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45805633068084717},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.4441414177417755},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4439942538738251},{"id":"https://openalex.org/keywords/graph-bandwidth","display_name":"Graph bandwidth","score":0.4184650480747223},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39202675223350525},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33961647748947144},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3373956084251404},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3211919367313385},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.28598886728286743},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.2356356382369995},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.0959668755531311},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.08327442407608032}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5189716219902039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.51618891954422},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5004012584686279},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49497169256210327},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48438674211502075},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4795522391796112},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.47701096534729004},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45805633068084717},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.4441414177417755},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4439942538738251},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.4184650480747223},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39202675223350525},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33961647748947144},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3373956084251404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3211919367313385},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.28598886728286743},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.2356356382369995},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0959668755531311},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.08327442407608032},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3209689","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3209689","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3209689","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},{"id":"pmh:oai:www.research.unipd.it:11577/3290299","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/3290299","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3209689","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3209689","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3209689","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G24500667","display_name":null,"funder_award_id":"CCF-1717075","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3389892740","display_name":"CCF-BSF: AF:Small: Time-Message Tradeoffs in Distributed Algorithms","funder_award_id":"1717075","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3829831297","display_name":"BIGDATA: Collaborative Research: F: Efficient Distributed Computation of Large-Scale Graph Problems in Epidemiology and Contagion Dynamics","funder_award_id":"1633720","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6111813407","display_name":null,"funder_award_id":"IIS-1633720","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7513945719","display_name":null,"funder_award_id":"CCF-1527867, CCF-1540512, IIS-1633720, and CCF-1717075","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7525902426","display_name":null,"funder_award_id":"CCF-1527867","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G844817646","display_name":null,"funder_award_id":"CCF-1540512","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8925879480","display_name":"BSF:2014424:Time-Message Tradeoffs in Distributed Algorithms","funder_award_id":"1540512","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/W2807720788.pdf","grobid_xml":"https://content.openalex.org/works/W2807720788.grobid-xml"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W217817341","https://openalex.org/W1497938971","https://openalex.org/W1515811018","https://openalex.org/W1592346261","https://openalex.org/W1595409123","https://openalex.org/W1736726159","https://openalex.org/W1945584931","https://openalex.org/W1964089073","https://openalex.org/W1975832752","https://openalex.org/W1982792741","https://openalex.org/W1987099434","https://openalex.org/W1992996565","https://openalex.org/W1997010704","https://openalex.org/W2016289973","https://openalex.org/W2040011014","https://openalex.org/W2043522657","https://openalex.org/W2045271686","https://openalex.org/W2051586153","https://openalex.org/W2063513700","https://openalex.org/W2068888615","https://openalex.org/W2069689700","https://openalex.org/W2077371116","https://openalex.org/W2083323175","https://openalex.org/W2101014999","https://openalex.org/W2107008873","https://openalex.org/W2107805020","https://openalex.org/W2107997203","https://openalex.org/W2116269179","https://openalex.org/W2138304862","https://openalex.org/W2139535340","https://openalex.org/W2144146806","https://openalex.org/W2149067844","https://openalex.org/W2153977620","https://openalex.org/W2170616854","https://openalex.org/W2240320246","https://openalex.org/W2245672739","https://openalex.org/W2255377757","https://openalex.org/W2296407087","https://openalex.org/W2340787257","https://openalex.org/W2399614914","https://openalex.org/W2460118749","https://openalex.org/W2488670996","https://openalex.org/W2547779378","https://openalex.org/W2570634592","https://openalex.org/W2611515161","https://openalex.org/W2739466586","https://openalex.org/W2762951336","https://openalex.org/W2899702797","https://openalex.org/W2952508553","https://openalex.org/W2962708242","https://openalex.org/W2963420932","https://openalex.org/W2963974406","https://openalex.org/W4205300528","https://openalex.org/W4229641819","https://openalex.org/W4252114072"],"related_works":["https://openalex.org/W2123112061","https://openalex.org/W2982699376","https://openalex.org/W4288264556","https://openalex.org/W2967413145","https://openalex.org/W2798294881","https://openalex.org/W2950943763","https://openalex.org/W4245591796","https://openalex.org/W1548306442","https://openalex.org/W2009179299","https://openalex.org/W2800933960"],"abstract_inverted_index":{"Motivated":[0],"by":[1,258],"the":[2,7,58,72,77,83,127,183,191],"increasing":[3],"need":[4],"to":[5,52,75,147,232],"understand":[6],"algorithmic":[8],"foundations":[9],"of":[10,19,79,82,132,153,158,173,185,243],"distributed":[11,28,92,187],"large-scale":[12],"graph":[13,21,49,96,177,188,214,255],"computations,":[14],"we":[15,198],"study":[16],"a":[17,24,61,112,148,171,195],"number":[18,78],"fundamental":[20],"problems":[22,257],"in":[23,64,101,151,182,262],"message-passing":[25],"model":[26],"for":[27,95,204,212,253],"computing":[29,205],"where":[30],"k":[31,45,59,105,136,164,224,249],"\u22652":[32],"machines":[33],"jointly":[34],"perform":[35],"computations":[36],"on":[37],"graphs":[38],"with":[39],"n":[40,43,103,114,121,134,162,222,247],"nodes":[41],"(typically,":[42],">":[44],").":[46,166],"The":[47],"input":[48],"is":[50,69,74,88,144],"assumed":[51],"be":[53],"initially":[54],"randomly":[55],"partitioned":[56],"among":[57],"machines,":[60],"common":[62],"implementation":[63],"many":[65,213,254],"real-world":[66],"systems.":[67],"Communication":[68],"point-to-point,":[70],"and":[71,117,143,211,228],"goal":[73],"minimize":[76],"communication":[80,264],"rounds":[81,108,227,252],"computation.":[84],"Our":[85,98,167],"main":[86],"result":[87],"an":[89,118,154,238],"(almost)":[90],"optimal":[91,145,230],"randomized":[93,202],"algorithm":[94,99,169,193],"connectivity.":[97],"runs":[100],"\u00d5(":[102,133,221],"/":[104,135,163,223,248],"2":[106,165,225,250],")":[107,115,122,137,226,251],"(\u00d5":[109],"notation":[110],"hides":[111],"polylog(":[113,120],"factor":[116],"additive":[119],"term).":[123],"This":[124],"improves":[125],"over":[126],"best":[128],"previously":[129],"known":[130],"bound":[131,157,242],"[Klauck":[138],"et":[139],"al.,":[140],"SODA":[141],"2015]":[142],"(up":[146],"polylogarithmic":[149,233],"factor)":[150],"light":[152],"existing":[155],"lower":[156,241,260],"\u03a9":[159,244],"\u02dc":[160,245],"(":[161,246],"improved":[168],"uses":[170],"bunch":[172],"techniques,":[174],"including":[175],"linear":[176],"sketching,":[178],"that":[179],"prove":[180],"useful":[181],"design":[184],"efficient":[186],"algorithms.":[189],"Using":[190],"connectivity":[192],"as":[194],"building":[196],"block,":[197],"then":[199],"present":[200],"fast":[201],"algorithms":[203,219],"minimum":[206],"spanning":[207],"trees,":[208],"(approximate)":[209],"min-cuts,":[210],"verification":[215,256],"problems.":[216],"All":[217],"these":[218],"take":[220],"are":[229],"up":[231],"factors.":[234],"We":[235],"also":[236],"show":[237],"almost":[239],"matching":[240],"leveraging":[259],"bounds":[261],"random-partition":[263],"complexity.":[265]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}