Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
Name
3490148.3538584.pdf
Size
1.61 MB
Format
Adobe PDF
Checksum (MD5)
c2e63116bec9fd622bf7fce5ac819ff3
Author(s)
Tseng, Tom
Dhulipala, Laxman
Shun, Julian
Date Issued
July 11, 2022
Publisher
ACM|Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
Citation
Tseng, Tom, Dhulipala, Laxman and Shun, Julian. 2022. "Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3490148.3538584
