Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model-Reference-Cited by-同舟云学术

Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model

Published:2020-07-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Anderson Daniel¹,Blelloch Guy E.¹,Tangwongsan Kanat²

Affiliation:

1. Carnegie Mellon University, Pittsburgh, PA, USA

2. Mahidol University International College, Bangkok, Thailand

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference54 articles.

1. Umut A Acar Daniel Anderson Guy E Blelloch Laxman Dhulipala and Sam Westrick. 2020. Parallel Batch-dynamic Trees via Change Propagation. arXiv preprint arXiv:2002.05129 [cs.DS] (2020). Umut A Acar Daniel Anderson Guy E Blelloch Laxman Dhulipala and Sam Westrick. 2020. Parallel Batch-dynamic Trees via Change Propagation. arXiv preprint arXiv:2002.05129 [cs.DS] (2020).

2. Umut A Acar Guy E Blelloch and Jorge L Vittes. 2005. An experimental analysis of change propagation in dynamic trees. In Algorithm Engineering and Experiments (ALENEX). Umut A Acar Guy E Blelloch and Jorge L Vittes. 2005. An experimental analysis of change propagation in dynamic trees. In Algorithm Engineering and Experiments (ALENEX).

3. Analyzing Graph Structure via Linear Measurements

4. Maintaining information in fully dynamic trees with top trees

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

2. Provably-Efficient and Internally-Deterministic Parallel Union-Find;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

3. Parallel Minimum Cuts in O ( m log ² n ) Work and Low Depth;ACM Transactions on Parallel Computing;2022-12-16

4. Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

5. Parallel Minimum Cuts in O ( m log 2 n ) Work and Low Depth;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06