{"id":"https://openalex.org/W4280508381","doi":"https://doi.org/10.1145/3490148.3538584","title":"Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering","display_name":"Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4280508381","doi":"https://doi.org/10.1145/3490148.3538584"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538584","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538584","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538584","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th 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":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538584","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087045282","display_name":"Tom Tseng","orcid":"https://orcid.org/0000-0002-6422-288X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tom Tseng","raw_affiliation_strings":["MIT CSAIL, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT CSAIL, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065818820","display_name":"Laxman Dhulipala","orcid":"https://orcid.org/0000-0003-0685-064X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laxman Dhulipala","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051583907","display_name":"Julian Shun","orcid":"https://orcid.org/0000-0001-6163-6625"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Julian Shun","raw_affiliation_strings":["MIT CSAIL, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"MIT CSAIL, Cambridge, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087045282"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2491,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82670955,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"233","last_page":"245"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9983000159263611,"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"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9983000159263611,"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/T11106","display_name":"Data Management and Algorithms","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/cluster-analysis","display_name":"Cluster analysis","score":0.6756924986839294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5929198265075684},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5651213526725769},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.5607220530509949},{"id":"https://openalex.org/keywords/linkage","display_name":"Linkage (software)","score":0.5019371509552002},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45314958691596985},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.42878082394599915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4148055613040924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3247831165790558},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24694901704788208},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16060936450958252}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6756924986839294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5929198265075684},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5651213526725769},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.5607220530509949},{"id":"https://openalex.org/C31266012","wikidata":"https://www.wikidata.org/wiki/Q6554340","display_name":"Linkage (software)","level":3,"score":0.5019371509552002},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45314958691596985},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.42878082394599915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4148055613040924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3247831165790558},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24694901704788208},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16060936450958252},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3490148.3538584","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538584","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538584","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/146278","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/146278","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM|Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3490148.3538584","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538584","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538584","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.6800000071525574,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[{"id":"https://openalex.org/G3636379132","display_name":null,"funder_award_id":"DE-SC0018947","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G3700309451","display_name":null,"funder_award_id":"#CCF-1845763","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4276282048","display_name":null,"funder_award_id":"CCF-1845763,CCF-2103483","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4363747310","display_name":"CAREER: Parallel Algorithms and Frameworks for Graph and Hypergraph Processing","funder_award_id":"1845763","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6078903008","display_name":null,"funder_award_id":"#DE-SC0018947","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G6650245637","display_name":null,"funder_award_id":"HR0011-18-3-0007","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G7809439052","display_name":null,"funder_award_id":"CCF-1845763","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8505467603","display_name":null,"funder_award_id":"2103483","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8510928812","display_name":null,"funder_award_id":"DE-SC0018947","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G8684776890","display_name":null,"funder_award_id":"E-SC0018947","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4280508381.pdf","grobid_xml":"https://content.openalex.org/works/W4280508381.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W108464071","https://openalex.org/W1486260668","https://openalex.org/W1539834906","https://openalex.org/W1547576067","https://openalex.org/W2018804864","https://openalex.org/W2040746822","https://openalex.org/W2045430818","https://openalex.org/W2049247788","https://openalex.org/W2078423836","https://openalex.org/W2079992488","https://openalex.org/W2094900885","https://openalex.org/W2098207812","https://openalex.org/W2102347446","https://openalex.org/W2110002382","https://openalex.org/W2132377940","https://openalex.org/W2133521834","https://openalex.org/W2141585940","https://openalex.org/W2146507303","https://openalex.org/W2152993997","https://openalex.org/W2153164850","https://openalex.org/W2153715991","https://openalex.org/W2157901347","https://openalex.org/W2159607037","https://openalex.org/W2436525433","https://openalex.org/W2562123954","https://openalex.org/W2744293559","https://openalex.org/W2923254968","https://openalex.org/W2949436541","https://openalex.org/W2951747536","https://openalex.org/W2963737091","https://openalex.org/W2964227864","https://openalex.org/W2964264613","https://openalex.org/W2988915797","https://openalex.org/W3006157595","https://openalex.org/W3041103022","https://openalex.org/W3103041003","https://openalex.org/W3105029140","https://openalex.org/W3117864297","https://openalex.org/W3124031623","https://openalex.org/W3128057791"],"related_works":["https://openalex.org/W1834608617","https://openalex.org/W1999627569","https://openalex.org/W2189021069","https://openalex.org/W2380998760","https://openalex.org/W763609066","https://openalex.org/W1493637077","https://openalex.org/W2183361621","https://openalex.org/W2186596455","https://openalex.org/W1508979878","https://openalex.org/W2381024503"],"abstract_inverted_index":{"Hierarchical":[0],"agglomerative":[1],"clustering":[2,9],"(HAC)":[3],"is":[4,49,86],"a":[5,41,50,58,112],"popular":[6],"algorithm":[7,53,69,92,115],"for":[8,18,54],"data,":[10],"but":[11],"despite":[12],"its":[13],"importance,":[14],"no":[15],"dynamic":[16,30,90],"algorithms":[17],"HAC":[19,31,37,123],"with":[20,82,98],"good":[21],"theoretical":[22],"guarantees":[23],"exist.":[24],"In":[25],"this":[26],"paper,":[27],"we":[28,110],"study":[29],"on":[32],"edge-weighted":[33],"graphs.":[34],"As":[35],"single-linkage":[36,121],"reduces":[38],"to":[39],"computing":[40],"minimum":[42],"spanning":[43],"forest":[44],"(MSF),":[45],"our":[46,66,107],"first":[47,88],"result":[48],"parallel":[51,113],"batch-dynamic":[52,67,114],"maintaining":[55],"MSFs.":[56],"On":[57],"batch":[59],"of":[60,95],"k":[61],"edge":[62,96],"insertions":[63],"or":[64],"deletions,":[65],"MSF":[68,91,108],"runs":[70],"in":[71],"O(k":[72],"log6":[73],"n)":[74,80],"expected":[75],"amortized":[76],"work":[77,100],"and":[78,103],"O(log4":[79],"span":[81],"high":[83],"probability.":[84],"It":[85],"the":[87],"fully":[89],"handling":[93],"batches":[94],"updates":[97],"polylogarithmic":[99,104],"per":[101],"update":[102],"span.":[105],"Using":[106],"algorithm,":[109],"obtain":[111],"that":[116],"can":[117],"answer":[118],"queries":[119],"about":[120],"graph":[122],"clusters.":[124]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}