{"id":"https://openalex.org/W4412481722","doi":"https://doi.org/10.1145/3694906.3743315","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","display_name":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412481722","doi":"https://doi.org/10.1145/3694906.3743315"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743315","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743315","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743315","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 37th 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/3694906.3743315","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114730512","display_name":"Quinten De Man","orcid":null},"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":true,"raw_author_name":"Quinten De Man","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0009-0009-1321-9590","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"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"],"raw_orcid":"https://orcid.org/0000-0003-0685-064X","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/A5061083611","display_name":"Kishen N. Gowda","orcid":"https://orcid.org/0000-0001-6573-9445"},"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":"Kishen N. Gowda","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":"https://orcid.org/0000-0001-6573-9445","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5114730512"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":1.1332,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.80062705,"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":"397","last_page":"412"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"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.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7301557064056396},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6333699226379395},{"id":"https://openalex.org/keywords/linkage","display_name":"Linkage (software)","score":0.5693624019622803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49922800064086914},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42672866582870483},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20893877744674683},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.06323254108428955}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7301557064056396},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6333699226379395},{"id":"https://openalex.org/C31266012","wikidata":"https://www.wikidata.org/wiki/Q6554340","display_name":"Linkage (software)","level":3,"score":0.5693624019622803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49922800064086914},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42672866582870483},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20893877744674683},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.06323254108428955},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3694906.3743315","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743315","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743315","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 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743315","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743315","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743315","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 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2539892673","display_name":"Collaborative Research: SHF: Medium: A Scalable Graph-Based Approach to Clustering","funder_award_id":"2403235","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G552722591","display_name":null,"funder_award_id":"2317194","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6341753913","display_name":null,"funder_award_id":"CCF-2403235 and CNS- 2317194","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412481722.pdf","grobid_xml":"https://content.openalex.org/works/W4412481722.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1978583881","https://openalex.org/W1985704385","https://openalex.org/W1993022201","https://openalex.org/W2013444956","https://openalex.org/W2018804864","https://openalex.org/W2045430818","https://openalex.org/W2065639164","https://openalex.org/W2102347446","https://openalex.org/W2121473031","https://openalex.org/W2565540516","https://openalex.org/W2804981860","https://openalex.org/W2963212338","https://openalex.org/W2964265366","https://openalex.org/W3013028797","https://openalex.org/W3117864297","https://openalex.org/W4210459256","https://openalex.org/W4223901115","https://openalex.org/W4231934124","https://openalex.org/W4245760501","https://openalex.org/W4255840500","https://openalex.org/W4285005134","https://openalex.org/W4385568416","https://openalex.org/W4386798157","https://openalex.org/W4388620443","https://openalex.org/W4407357395"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W4282976635","https://openalex.org/W2358668433","https://openalex.org/W4396701345"],"abstract_inverted_index":{"Single-linkage":[0],"clustering":[1,9],"is":[2,17,37,44],"a":[3,71],"popular":[4],"form":[5],"of":[6,26,51,91],"hierarchical":[7],"agglomerative":[8],"(HAC)":[10],"where":[11],"the":[12,20,29,35,39,45,49,57,62,76,84,87,92],"distance":[13,22],"between":[14,23],"two":[15,30,58],"clusters":[16,52],"defined":[18],"as":[19],"minimum":[21,72,88],"any":[24],"pair":[25],"points":[27],"across":[28],"clusters.":[31,60],"In":[32,61],"single-linkage":[33,40,79],"HAC,":[34],"output":[36],"typically":[38],"dendrogram":[41],"(SLD),":[42],"which":[43],"binary":[46],"tree":[47],"representing":[48],"hierarchy":[50],"formed":[53],"by":[54],"iteratively":[55],"contracting":[56],"closest":[59],"dynamic":[63],"setting,":[64],"prior":[65],"work":[66],"has":[67],"only":[68],"studied":[69],"maintaining":[70],"spanning":[73,89],"forest":[74,90],"over":[75],"data":[77],"since":[78],"HAC":[80],"reduces":[81],"to":[82],"computing":[83],"SLD":[85],"on":[86],"data.":[93]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}