Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering

Author(s)
Tseng, Tom; Dhulipala, Laxman; Shun, Julian
Thumbnail
Download3490148.3538584.pdf (1.609Mb)
Publisher with Creative Commons License
Terms of use
Creative Commons Attribution 4.0 International license https://creativecommons.org/licenses/by/4.0/
Metadata
Show full item record
Date issued
2022-07-11
URI
https://hdl.handle.net/1721.1/146278
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
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
ISBN
978-1-4503-9146-7
Collections

The following license files are associated with this item: