{"id":"https://openalex.org/W4207077849","doi":"https://doi.org/10.1145/3491003.3491011","title":"Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation","display_name":"Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation","publication_year":2022,"publication_date":"2022-01-04","ids":{"openalex":"https://openalex.org/W4207077849","doi":"https://doi.org/10.1145/3491003.3491011"},"language":"en","primary_location":{"id":"doi:10.1145/3491003.3491011","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3491003.3491011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1135413","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009632507","display_name":"Eric Ajieren","orcid":null},"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":"Eric Ajieren","raw_affiliation_strings":["University of Houston, United States"],"affiliations":[{"raw_affiliation_string":"University of Houston, United States","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058504086","display_name":"Khalid Hourani","orcid":"https://orcid.org/0000-0002-2367-7124"},"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":"Khalid Hourani","raw_affiliation_strings":["Department of Computer Science, University of Houston, United States"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Houston, United States","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070835473","display_name":"William K. Moses","orcid":"https://orcid.org/0000-0002-4533-7593"},"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":"William K. Moses Jr.","raw_affiliation_strings":["Department of Computer Science, University of Houston, United States"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Houston, United States","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"last","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":false,"raw_author_name":"Gopal Pandurangan","raw_affiliation_strings":["Department of Computer Science, University of Houston, United States"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Houston, United States","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5009632507"],"corresponding_institution_ids":["https://openalex.org/I44461941"],"apc_list":null,"apc_paid":null,"fwci":0.2013,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.44022438,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"40","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7826887369155884},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7394213080406189},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5687372088432312},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5618224740028381},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5053313374519348},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4911632239818573},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4630240499973297},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42305833101272583},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.41997942328453064},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2948070466518402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1948251724243164},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16108834743499756}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7826887369155884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7394213080406189},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5687372088432312},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5618224740028381},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5053313374519348},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4911632239818573},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4630240499973297},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42305833101272583},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.41997942328453064},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2948070466518402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1948251724243164},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16108834743499756}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3491003.3491011","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3491003.3491011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},{"id":"pmh:oai:durham-repository.worktribe.com:1135413","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1135413","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1135413","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1135413","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":"Presentation / Conference Contribution"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4536514774","display_name":null,"funder_award_id":"CCF-1527867,CCF-1540512,IIS-1633720,CCF-1717075","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W217817341","https://openalex.org/W1859126261","https://openalex.org/W1971734630","https://openalex.org/W1982792741","https://openalex.org/W2016289973","https://openalex.org/W2063513700","https://openalex.org/W2067661972","https://openalex.org/W2077371116","https://openalex.org/W2088011174","https://openalex.org/W2137373960","https://openalex.org/W2144146806","https://openalex.org/W2153977620","https://openalex.org/W2170616854","https://openalex.org/W2296407087","https://openalex.org/W2590926957","https://openalex.org/W2950274216","https://openalex.org/W2952500888","https://openalex.org/W2962708242","https://openalex.org/W3041507026","https://openalex.org/W3175890732","https://openalex.org/W3183881215","https://openalex.org/W3184913911","https://openalex.org/W4205300528","https://openalex.org/W4213146104","https://openalex.org/W4251624562","https://openalex.org/W4301897667","https://openalex.org/W6672570519"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W8653221","https://openalex.org/W4297934114","https://openalex.org/W1524692559","https://openalex.org/W1977502354","https://openalex.org/W3067869622"],"abstract_inverted_index":{"We":[0,19],"study":[1],"distributed":[2,28],"algorithms":[3],"for":[4,27,30],"large-scale":[5,31],"graphs,":[6],"focusing":[7],"on":[8,42],"the":[9,21,62,76,81,89],"fundamental":[10],"problems":[11],"of":[12,83,88],"connectivity":[13],"and":[14,75],"minimum":[15],"spanning":[16],"tree":[17],"(MST).":[18],"consider":[20],"k-machine":[22],"model,":[23],"a":[24,65],"well-studied":[25],"model":[26],"computing":[29],"graph":[32,53],"computations,":[33],"where":[34],"k":[35,63],"\u2265":[36],"2":[37],"machines":[38],"jointly":[39],"perform":[40],"computations":[41],"graphs":[43],"with":[44],"n":[45,48],"nodes":[46],"(typically,":[47],"\u226b":[49],"k).":[50],"The":[51],"input":[52],"is":[54,73,78],"assumed":[55],"to":[56,79],"be":[57],"initially":[58],"randomly":[59],"partitioned":[60],"among":[61],"machines,":[64],"common":[66],"implementation":[67],"in":[68],"many":[69],"real-world":[70],"systems.":[71],"Communication":[72],"point-to-point,":[74],"goal":[77],"minimize":[80],"number":[82],"communication":[84],"rounds":[85],"(denoted":[86],"Tc)":[87],"computation.":[90]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}