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

Tom Tseng, Laxman Dhulipala, Julian Shun. Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. In Kunal Agrawal, I-Ting Angelina Lee, editors, SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022. pages 233-245, ACM, 2022. [doi]

@inproceedings{TsengDS22,
  title = {Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering},
  author = {Tom Tseng and Laxman Dhulipala and Julian Shun},
  year = {2022},
  doi = {10.1145/3490148.3538584},
  url = {https://doi.org/10.1145/3490148.3538584},
  researchr = {https://researchr.org/publication/TsengDS22},
  cites = {0},
  citedby = {0},
  pages = {233-245},
  booktitle = {SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022},
  editor = {Kunal Agrawal and I-Ting Angelina Lee},
  publisher = {ACM},
  isbn = {978-1-4503-9146-7},
}