{"id":"https://openalex.org/W2460118749","doi":"https://doi.org/10.1145/2935764.2935785","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":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2460118749","doi":"https://doi.org/10.1145/2935764.2935785","mag":"2460118749"},"language":"en","primary_location":{"id":"doi:10.1145/2935764.2935785","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935785","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935785&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2935785&type=pdf","any_repository_has_fulltext":true},"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, USA"],"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, 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/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Peter Robinson","raw_affiliation_strings":["University of London, London, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of London, London, United Kingdom","institution_ids":["https://openalex.org/I124357947"]}]},{"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, Houston, USA"],"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, USA","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":6.8284,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.96923212,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"429","last_page":"438"},"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.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/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/T10237","display_name":"Cryptography and Data Security","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9973000288009644,"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.5395808219909668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5070273876190186},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49884510040283203},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48168644309043884},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.48121002316474915},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4808552861213684},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45318740606307983},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4503836929798126},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.44921875},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4172170162200928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38272595405578613},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3204646110534668},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.0946199893951416},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.08295261859893799}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5395808219909668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5070273876190186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49884510040283203},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48168644309043884},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.48121002316474915},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4808552861213684},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45318740606307983},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4503836929798126},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.44921875},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4172170162200928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38272595405578613},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3204646110534668},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0946199893951416},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.08295261859893799},{"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/2935764.2935785","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935785","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935785&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:www.research.unipd.it:11577/3300961","is_oa":true,"landing_page_url":"http://hdl.handle.net/11577/3300961","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.1145/2935764.2935785","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935785","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935785&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2134827209","display_name":null,"funder_award_id":"CCF-1540512, CCF-1527867","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/W2460118749.pdf","grobid_xml":"https://content.openalex.org/works/W2460118749.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W217817341","https://openalex.org/W1515811018","https://openalex.org/W1568961751","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/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/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/W2156396224","https://openalex.org/W2170616854","https://openalex.org/W2245672739","https://openalex.org/W2255377757","https://openalex.org/W2281539709","https://openalex.org/W2347145740","https://openalex.org/W2399614914","https://openalex.org/W2460118749","https://openalex.org/W2570634592","https://openalex.org/W2611515161","https://openalex.org/W2739466586","https://openalex.org/W2950813619"],"related_works":["https://openalex.org/W2123112061","https://openalex.org/W2950943763","https://openalex.org/W2982699376","https://openalex.org/W2967413145","https://openalex.org/W2798294881","https://openalex.org/W4288264556","https://openalex.org/W2957594956","https://openalex.org/W2009179299","https://openalex.org/W4245591796","https://openalex.org/W2125986699"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"the":[2,7,58,72,77,83,118,163],"increasing":[3],"need":[4],"to":[5,52,75,134,199],"understand":[6],"algorithmic":[8],"foundations":[9],"of":[10,19,79,82,123,140,145,153,165,210],"distributed":[11,28,92,167],"large-scale":[12],"graph":[13,21,49,96,157,168,186,214],"computations,":[14],"we":[15],"study":[16],"a":[17,24,61,107,135,151],"number":[18,78],"fundamental":[20],"problems":[22,216],"in":[23,64,101,138,162,220],"message-passing":[25],"model":[26],"for":[27,95,176,184,212],"computing":[29,177],"where":[30],"k":[31,59],"\u2265":[32],"2":[33],"machines":[34],"jointly":[35],"perform":[36],"computations":[37],"on":[38],"graphs":[39],"with":[40],"n":[41,44],"nodes":[42],"(typically,":[43],"gg":[45],"k).":[46],"The":[47],"input":[48],"is":[50,69,74,88,131],"assumed":[51],"be":[53],"initially":[54],"randomly":[55],"partitioned":[56],"among":[57],"machines,":[60],"common":[62],"implementation":[63],"many":[65,185,213],"real-world":[66],"systems.":[67],"Communication":[68],"point-to-point,":[70],"and":[71,110,130,183,195],"goal":[73],"minimize":[76],"communication":[80,222],"rounds":[81,103],"computation.":[84],"Our":[85,98,147],"main":[86],"result":[87],"an":[89,111,141,205],"(almost)":[90],"optimal":[91,132,197],"randomized":[93,174],"algorithm":[94,99,149],"connectivity.":[97],"runs":[100],"~O(n/k2)":[102,193],"(~O":[104],"notation":[105],"hides":[106],"polylog(n)":[108,113],"factor":[109],"additive":[112],"term).":[114],"This":[115],"improves":[116],"over":[117],"best":[119],"previously":[120],"known":[121],"bound":[122,144,209],"~O(n/k)":[124],"[Klauck":[125],"et":[126],"al.,":[127],"SODA":[128],"2015],":[129],"(up":[133],"polylogarithmic":[136,200],"factor)":[137],"view":[139],"existing":[142],"lower":[143,208,218],"~\u03a9(n/k2).":[146],"improved":[148],"uses":[150],"bunch":[152],"techniques,":[154],"including":[155],"linear":[156],"sketching,":[158],"that":[159],"prove":[160],"useful":[161],"design":[164],"efficient":[166],"algorithms.":[169],"We":[170,202],"then":[171],"present":[172],"fast":[173],"algorithms":[175,191],"minimum":[178],"spanning":[179],"trees,":[180],"(approximate)":[181],"min-cuts,":[182],"verification":[187,215],"problems.":[188],"All":[189],"these":[190],"take":[192],"rounds,":[194],"are":[196],"up":[198],"factors.":[201],"also":[203],"show":[204],"almost":[206],"matching":[207],"~\u03a9(n/k2)":[211],"using":[217],"bounds":[219],"random-partition":[221],"complexity.":[223]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}