Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering-Reference-Cited by-同舟云学术

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

Published:2022-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Tseng Tom¹,Dhulipala Laxman²,Shun Julian¹

Affiliation:

1. MIT CSAIL, Cambridge, MA, USA

2. University of Maryland, College Park, MD, USA

Funder

DARPA

National Science Foundation

U.S. Department of Energy

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3490148.3538584

Reference49 articles.

2. Parallel Batch-Dynamic Graph Connectivity

3. Umut A. Acar , Daniel Anderson , Guy E. Blelloch , Laxman Dhulipala , and Sam Westrick . 2020 . Parallel Batch-Dynamic Trees via Change Propagation . In 28th Annual European Symposium on Algorithms , Vol. 173 . 2:1--2:23. Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, and Sam Westrick. 2020. Parallel Batch-Dynamic Trees via Change Propagation. In 28th Annual European Symposium on Algorithms, Vol. 173. 2:1--2:23.

4. Umit A Acar , Guy E Blelloch , Robert Harper , Jorge L Vittes , and Shan Leung Maverick Woo . 2004 . Dynamizing Static Algorithms, with Applications to Dynamic Trees and History Independence . In Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms , Vol. 531 . 540. Umit A Acar, Guy E Blelloch, Robert Harper, Jorge L Vittes, and Shan Leung Maverick Woo. 2004. Dynamizing Static Algorithms, with Applications to Dynamic Trees and History Independence. In Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, Vol. 531. 540.

5. Stephen Alstrup Jacob Holm Kristian de Lichtenberg and Mikkel Thorup. 1997. Minimizing Diameters of Dynamic Trees. In International Colloquium on Automata Languages and Programming. 270--280. Stephen Alstrup Jacob Holm Kristian de Lichtenberg and Mikkel Thorup. 1997. Minimizing Diameters of Dynamic Trees. In International Colloquium on Automata Languages and Programming. 270--280.