Efficient Multicore Algorithms For Identifying Biconnected Components-Reference-Cited by-同舟云学术

Efficient Multicore Algorithms For Identifying Biconnected Components

Published:2016 Issue:1 Volume:6 Page:87-106
ISSN:2185-2839
Container-title:International Journal of Networking and Computing
language:en
Short-container-title:IJNC

Author:

Chaitanya Meher¹,Kothapalli Kishore¹

Affiliation:

1. International Institute of Information Technology Hyderabad

Publisher

IJNC Editorial Committee

Link

https://www.jstage.jst.go.jp/article/ijnc/6/1/6_87/_pdf

Reference22 articles.

1. [1] Stanford network analysis platform dataset. http://www.cise.u.edu/research/sparse/ matrices/{SNAP}.

2. [2] The University of Florida Sparse Matrix Collection. http://www.cise.ufl.edu/research/sparse/matrices/.

3. [3] Bader, D. A., and Madduri, K. GTgrpah: A suite of synthetic graph generators.

4. [4] Banerjee, D. S., Sharma, S., and Kothapalli, K. Work efficient parallel algorithms for large graph exploration. In Proc. HiPC (2013), pp. 433–442.

5. [5] Bollobas, B. Random Graphs. Cambridge University Press, 2001.

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

1. Provably Fast and Space-Efficient Parallel Biconnectivity;Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2023-02-21

2. Efficient Parallel Algorithms for Computing Percolation Centrality;2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC);2021-12

3. A Parallel Graph Algorithm for Detecting Mesh Singularities in Distributed Memory Ice Sheet Simulations;Proceedings of the 48th International Conference on Parallel Processing;2019-08-05