{"id":"https://openalex.org/W3169714987","doi":"https://doi.org/10.1145/3448016.3457296","title":"Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering","display_name":"Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering","publication_year":2021,"publication_date":"2021-06-09","ids":{"openalex":"https://openalex.org/W3169714987","doi":"https://doi.org/10.1145/3448016.3457296","mag":"3169714987"},"language":"en","primary_location":{"id":"doi:10.1145/3448016.3457296","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3448016.3457296","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3448016.3457296","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","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/3448016.3457296","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102983434","display_name":"Yiqiu Wang","orcid":"https://orcid.org/0000-0002-1760-3911"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yiqiu Wang","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063461740","display_name":"Shangdi Yu","orcid":"https://orcid.org/0000-0002-8907-692X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shangdi Yu","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100352651","display_name":"Yan Gu","orcid":"https://orcid.org/0000-0002-4392-4022"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yan Gu","raw_affiliation_strings":["University of California, Riverside, Riverside, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051583907","display_name":"Julian Shun","orcid":"https://orcid.org/0000-0001-6163-6625"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julian Shun","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5102983434"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":3.3944,"has_fulltext":true,"cited_by_count":33,"citation_normalized_percentile":{"value":0.93245503,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1982","last_page":"1995"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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/T10799","display_name":"Data Visualization and Analytics","score":0.9986000061035156,"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.7797037363052368},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6852589845657349},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6770666837692261},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6574894189834595},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.544677197933197},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5362178087234497},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5002238750457764},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.487925261259079},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4608911871910095},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.43681278824806213},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4339365065097809},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42971938848495483},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42934852838516235},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4217971861362457},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.4155595302581787},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38444983959198},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2861924469470978},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1211712658405304}],"concepts":[{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.7797037363052368},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6852589845657349},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6770666837692261},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6574894189834595},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.544677197933197},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5362178087234497},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5002238750457764},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.487925261259079},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4608911871910095},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.43681278824806213},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4339365065097809},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42971938848495483},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42934852838516235},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4217971861362457},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.4155595302581787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38444983959198},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2861924469470978},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1211712658405304},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3448016.3457296","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3448016.3457296","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3448016.3457296","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3448016.3457296","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3448016.3457296","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3448016.3457296","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1065316766","display_name":null,"funder_award_id":"Award","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/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/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/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/W3169714987.pdf","grobid_xml":"https://content.openalex.org/works/W3169714987.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W23573688","https://openalex.org/W58415858","https://openalex.org/W108464071","https://openalex.org/W1578711506","https://openalex.org/W1599454686","https://openalex.org/W1978583881","https://openalex.org/W1979109797","https://openalex.org/W1979312837","https://openalex.org/W1985704385","https://openalex.org/W1990823052","https://openalex.org/W2007610503","https://openalex.org/W2018359542","https://openalex.org/W2024668293","https://openalex.org/W2031671531","https://openalex.org/W2035729201","https://openalex.org/W2048968215","https://openalex.org/W2049631158","https://openalex.org/W2054011861","https://openalex.org/W2056578260","https://openalex.org/W2067298033","https://openalex.org/W2078197718","https://openalex.org/W2079207448","https://openalex.org/W2092720654","https://openalex.org/W2093241092","https://openalex.org/W2100928221","https://openalex.org/W2112183601","https://openalex.org/W2120490947","https://openalex.org/W2130566259","https://openalex.org/W2135063076","https://openalex.org/W2143394441","https://openalex.org/W2150303531","https://openalex.org/W2152993997","https://openalex.org/W2156912724","https://openalex.org/W2160642098","https://openalex.org/W2165274952","https://openalex.org/W2180566385","https://openalex.org/W2189503625","https://openalex.org/W2293942356","https://openalex.org/W2295800032","https://openalex.org/W2486737114","https://openalex.org/W2570579522","https://openalex.org/W2740025111","https://openalex.org/W2767502276","https://openalex.org/W2798771577","https://openalex.org/W2799132955","https://openalex.org/W2923023146","https://openalex.org/W3020965650","https://openalex.org/W3028763582","https://openalex.org/W3104921985","https://openalex.org/W3117864297","https://openalex.org/W4237407686","https://openalex.org/W4247105055","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W1561849181","https://openalex.org/W2381121915","https://openalex.org/W2418231958","https://openalex.org/W2387385213","https://openalex.org/W2390742649","https://openalex.org/W3016811403","https://openalex.org/W2589768050","https://openalex.org/W4380840098","https://openalex.org/W2384589661","https://openalex.org/W4206043061"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"new":[3,45,64],"parallel":[4,65],"algorithms":[5,95],"for":[6,58,68,86],"generating":[7,24],"Euclidean":[8],"minimum":[9,33],"spanning":[10,34],"trees":[11],"and":[12,37,53,72,89,109],"spatial":[13],"clustering":[14],"hierarchies":[15],"(known":[16],"as":[17],"HDBSCAN*).":[18],"Our":[19],"approach":[20],"is":[21],"based":[22],"on":[23],"a":[25,44,63],"well-separated":[26],"pair":[27,40],"decomposition":[28],"followed":[29],"by":[30],"using":[31],"Kruskal's":[32],"tree":[35],"algorithm":[36,57,67],"bichromatic":[38],"closest":[39],"computations.":[41],"We":[42,60,91],"introduce":[43],"notion":[46],"of":[47,55,81,103],"well-separation":[48],"to":[49],"reduce":[50],"the":[51,70],"work":[52,101],"space":[54],"our":[56,94],"HDBSCAN*.":[59,90],"also":[61],"give":[62],"divide-and-conquer":[66],"computing":[69],"dendrogram":[71],"reachability":[73],"plots,":[74],"which":[75],"are":[76,96],"used":[77],"in":[78],"visualizing":[79],"clusters":[80],"different":[82],"scale":[83],"that":[84,93],"arise":[85],"both":[87],"EMST":[88],"show":[92],"theoretically":[97],"efficient:":[98],"they":[99],"have":[100],"(number":[102],"operations)":[104],"matching":[105],"their":[106],"sequential":[107],"counterparts,":[108],"polylogarithmic":[110],"depth":[111],"(parallel":[112],"time).":[113]},"counts_by_year":[{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}