OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
Parallel algorithms for finding connected components using linear algebra
Yongzhe Zhang, Ariful Azad, Aydın Buluç
Journal of Parallel and Distributed Computing (2020) Vol. 144, pp. 14-27
Open Access | Times Cited: 18
Yongzhe Zhang, Ariful Azad, Aydın Buluç
Journal of Parallel and Distributed Computing (2020) Vol. 144, pp. 14-27
Open Access | Times Cited: 18
Showing 18 citing articles:
GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
Carl Yang, Aydın Buluç, John D. Owens
ACM Transactions on Mathematical Software (2022) Vol. 48, Iss. 1, pp. 1-51
Open Access | Times Cited: 58
Carl Yang, Aydın Buluç, John D. Owens
ACM Transactions on Mathematical Software (2022) Vol. 48, Iss. 1, pp. 1-51
Open Access | Times Cited: 58
Parallel Ant Colony Optimization Algorithm for Finding the Shortest Path for Mountain Climbing
Esraa Alhenawi, Ruba Abu Khurma, Ahmad Sharieh, et al.
IEEE Access (2023) Vol. 11, pp. 6185-6196
Open Access | Times Cited: 12
Esraa Alhenawi, Ruba Abu Khurma, Ahmad Sharieh, et al.
IEEE Access (2023) Vol. 11, pp. 6185-6196
Open Access | Times Cited: 12
Algorithm 1037: SuiteSparse:GraphBLAS: Parallel Graph Algorithms in the Language of Sparse Linear Algebra
Timothy A. Davis
ACM Transactions on Mathematical Software (2023) Vol. 49, Iss. 3, pp. 1-30
Open Access | Times Cited: 8
Timothy A. Davis
ACM Transactions on Mathematical Software (2023) Vol. 49, Iss. 3, pp. 1-30
Open Access | Times Cited: 8
Best path in mountain environment based on parallel A* algorithm and Apache Spark
Hadeel Alazzam, Orieb AbuAlghanam, Ahmad Sharieh
The Journal of Supercomputing (2021) Vol. 78, Iss. 4, pp. 5075-5094
Closed Access | Times Cited: 15
Hadeel Alazzam, Orieb AbuAlghanam, Ahmad Sharieh
The Journal of Supercomputing (2021) Vol. 78, Iss. 4, pp. 5075-5094
Closed Access | Times Cited: 15
EXAGRAPH: Graph and combinatorial methods for enabling exascale applications
Seher Acer, Ariful Azad, Erik G. Boman, et al.
The International Journal of High Performance Computing Applications (2021) Vol. 35, Iss. 6, pp. 553-571
Open Access | Times Cited: 11
Seher Acer, Ariful Azad, Erik G. Boman, et al.
The International Journal of High Performance Computing Applications (2021) Vol. 35, Iss. 6, pp. 553-571
Open Access | Times Cited: 11
LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms
Gábor Szárnyas, David A. Bader, Timothy A. Davis, et al.
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2021), pp. 243-252
Open Access | Times Cited: 6
Gábor Szárnyas, David A. Bader, Timothy A. Davis, et al.
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2021), pp. 243-252
Open Access | Times Cited: 6
Adaptive Rigidification of Discrete Shells
Alexandre Mercier-Aubin, Paul G. Kry
Proceedings of the ACM on Computer Graphics and Interactive Techniques (2023) Vol. 6, Iss. 3, pp. 1-17
Open Access | Times Cited: 2
Alexandre Mercier-Aubin, Paul G. Kry
Proceedings of the ACM on Computer Graphics and Interactive Techniques (2023) Vol. 6, Iss. 3, pp. 1-17
Open Access | Times Cited: 2
Communication-Avoiding Recursive Aggregation
Yihao Sun, Sidharth Kumar, Thomas Gilray, et al.
(2023), pp. 197-208
Closed Access | Times Cited: 2
Yihao Sun, Sidharth Kumar, Thomas Gilray, et al.
(2023), pp. 197-208
Closed Access | Times Cited: 2
Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU
Jou-An Chen, Hsin-Hsuan Sung, Xipeng Shen, et al.
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2022), pp. 515-525
Open Access | Times Cited: 4
Jou-An Chen, Hsin-Hsuan Sung, Xipeng Shen, et al.
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2022), pp. 515-525
Open Access | Times Cited: 4
Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis
Tony Liu, Andrew Lumsdaine, Mahantesh Halappanavar, et al.
ACM Journal of Experimental Algorithmics (2022) Vol. 27, pp. 1-31
Open Access | Times Cited: 3
Tony Liu, Andrew Lumsdaine, Mahantesh Halappanavar, et al.
ACM Journal of Experimental Algorithmics (2022) Vol. 27, pp. 1-31
Open Access | Times Cited: 3
BTS: Load-Balanced Distributed Union-Find for Finding Connected Components with Balanced Tree Structures
Chaeeun Kim, Changhun Han, Ha-Myung Park
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 1090-1102
Closed Access
Chaeeun Kim, Changhun Han, Ha-Myung Park
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 1090-1102
Closed Access
Fast Distributed Memory Parallel Algorithms for Finding Connected Components in Large Graphs
Maleq Khan, S Boddu
2021 IEEE International Conference on Big Data (Big Data) (2024), pp. 579-588
Closed Access
Maleq Khan, S Boddu
2021 IEEE International Conference on Big Data (Big Data) (2024), pp. 579-588
Closed Access
High-Performance and Programmable Attentional Graph Neural Networks with Global Tensor Formulations
Maciej Besta, Paweł Renc, Robert Gerstenberger, et al.
(2023), pp. 1-16
Closed Access | Times Cited: 1
Maciej Besta, Paweł Renc, Robert Gerstenberger, et al.
(2023), pp. 1-16
Closed Access | Times Cited: 1
LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms
Gábor Szárnyas, David A. Bader, Timothy A. Davis, et al.
(2021)
Closed Access | Times Cited: 1
Gábor Szárnyas, David A. Bader, Timothy A. Davis, et al.
(2021)
Closed Access | Times Cited: 1
VPC: Pruning connected components using vector-based path compression for Graph500
Hao Bai, Xinbiao Gan, Tianjing Xu, et al.
CCF Transactions on High Performance Computing (2021) Vol. 3, Iss. 3, pp. 271-285
Closed Access | Times Cited: 1
Hao Bai, Xinbiao Gan, Tianjing Xu, et al.
CCF Transactions on High Performance Computing (2021) Vol. 3, Iss. 3, pp. 271-285
Closed Access | Times Cited: 1
Research on Visual SLAM Navigation Techniques for Dynamic Environments
Tongjun Wang, Peijun Zhao
International Journal of Distributed Sensor Networks (2023) Vol. 2023, pp. 1-10
Open Access
Tongjun Wang, Peijun Zhao
International Journal of Distributed Sensor Networks (2023) Vol. 2023, pp. 1-10
Open Access
Extracting connectivity paths in digital core images using solution of partial minimum eigenvalue problem
Serguei Maliassov, Yuri Vassilevski
Russian Journal of Numerical Analysis and Mathematical Modelling (2023) Vol. 38, Iss. 6, pp. 373-380
Closed Access
Serguei Maliassov, Yuri Vassilevski
Russian Journal of Numerical Analysis and Mathematical Modelling (2023) Vol. 38, Iss. 6, pp. 373-380
Closed Access
Fast 3D Euclidean Connected Components
W. Randolph Franklin, Salles V. G. Magalhães, Eric N. Landis
ACM eBooks (2023), pp. 17-28
Closed Access
W. Randolph Franklin, Salles V. G. Magalhães, Eric N. Landis
ACM eBooks (2023), pp. 17-28
Closed Access
