Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity-Reference-Cited by-同舟云学术

Work-Efficient Parallel Union-Find with Applications to Incremental Graph Connectivity

Published:2016 Issue: Volume: Page:561-573
ISSN:0302-9743
Container-title:Euro-Par 2016: Parallel Processing
language:
Short-container-title:

Author:

Simsiri Natcha,Tangwongsan Kanat,Tirthapura Srikanta,Wu Kun-Lung

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-43659-3_41

Reference18 articles.

1. IBM Corporation: IBM Streams. http://www-03.ibm.com/software/products/en/ibm-streams . Accessed Feb 2016

2. Zaharia, M., Das, T., Li, H., Hunter, T., Shenker, S., Stoica, I.: Discretized streams: fault-tolerant streaming computation at scale. In: Proceedings of ACM Symposium on Operating Systems Principles (SOSP), pp. 423–438 (2013)

3. Simsiri, N., Tangwongsan, K., Tirthapura, S., Wu, K.L.: Work-efficient parallel and incremental graph connectivity. Technical report, arXiv (2016). https://arxiv.org/

4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)

5. Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215–225 (1975)

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

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

2. Shared-Memory Parallel Algorithms for Fully Dynamic Maintenance of 2-Connected Components;2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2022-05

3. Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs;Proceedings of the 2021 International Conference on Management of Data;2021-06-09

4. Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs;2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2021-06

5. Input-Dynamic Distributed Algorithms for Communication Networks;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2021-02-18