Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

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:

A round-efficient distributed betweenness centrality algorithm
Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, et al.
(2019)
Open Access | Times Cited: 35

Showing 1-25 of 35 citing articles:

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
(2018), pp. 393-404
Open Access | Times Cited: 67
Single machine graph analytics on massive datasets using Intel optane DC persistent memory
Gurbinder Gill, Roshan Dathathri, Loc Hoang, et al.
Proceedings of the VLDB Endowment (2020) Vol. 13, Iss. 8, pp. 1304-1318
Open Access | Times Cited: 61
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
ACM Transactions on Parallel Computing (2021) Vol. 8, Iss. 1, pp. 1-70
Open Access | Times Cited: 43
A Survey of Distributed Graph Algorithms on Massive Graphs
Lingkai Meng, Yu Shao, Long Yuan, et al.
ACM Computing Surveys (2024)
Closed Access | Times Cited: 6
Distributed exact weighted all-pairs shortest paths in near-linear time
Aaron Bernstein, Danupon Nanongkai
(2019), pp. 334-342
Open Access | Times Cited: 44
Graph Neural Networks for Fast Node Ranking Approximation
Sunil Kumar Maurya, Xin Liu, Tsuyoshi Murata
ACM Transactions on Knowledge Discovery from Data (2021) Vol. 15, Iss. 5, pp. 1-32
Open Access | Times Cited: 32
Efficient Exact and Approximate Betweenness Centrality Computation for Temporal Graphs
Tianming Zhang, Yunjun Gao, Jie Zhao, et al.
Proceedings of the ACM Web Conference 2022 (2024), pp. 2395-2406
Closed Access | Times Cited: 4
Efficient Parallel Algorithm for Approximating Betweenness Centrality Values of Top k Nodes in Large Graphs
İsmail Hakkı Toroslu, Gadir Suleymanli
Concurrency and Computation Practice and Experience (2025) Vol. 37, Iss. 4-5
Closed Access
Distributed edge connectivity in sublinear time
Mohit Daga, Monika Henzinger, Danupon Nanongkai, et al.
(2019), pp. 343-354
Open Access | Times Cited: 34
Gluon-Async: A Bulk-Asynchronous System for Distributed and Heterogeneous Graph Analytics
Roshan Dathathri, Gurbinder Gill, Loc Hoang, et al.
(2019), pp. 15-28
Closed Access | Times Cited: 19
Centrality Measures: A Tool to Identify Key Actors in Social Networks
Rishi Ranjan Singh
Smart innovation, systems and technologies (2021), pp. 1-27
Closed Access | Times Cited: 15
Distributed Weighted All Pairs Shortest Paths Through Pipelining
Udit Agarwal, Vijaya Ramachandran
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2019), pp. 23-32
Closed Access | Times Cited: 16
Galliot: Path Merging Based Betweenness Centrality Algorithm on GPU
Zhigao Zheng, Chen Zhao, Peichen Xie, et al.
IEEE INFOCOM 2022 - IEEE Conference on Computer Communications (2023), pp. 1-10
Closed Access | Times Cited: 5
Path Merging Based Betweenness Centrality Algorithm in Delay Tolerant Networks
Zhigao Zheng, Bo Du, Chen Zhao, et al.
IEEE Journal on Selected Areas in Communications (2023) Vol. 41, Iss. 10, pp. 3133-3145
Closed Access | Times Cited: 5
Faster Deterministic All Pairs Shortest Paths in Congest Model
Udit Agarwal, Vijaya Ramachandran
(2020), pp. 11-21
Open Access | Times Cited: 14
AsynGraph
Yu Zhang, Xiaofei Liao, Lin Gu, et al.
ACM Transactions on Architecture and Code Optimization (2020) Vol. 17, Iss. 4, pp. 1-21
Open Access | Times Cited: 12
Improving model performance of shortest‐path‐based centrality measures in network models through scale space
Kenan Mengüç, Alper Yılmaz
Concurrency and Computation Practice and Experience (2024) Vol. 36, Iss. 14
Closed Access | Times Cited: 1
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling
Alexander van der Grinten, Henning Meyerhenke
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2020)
Open Access | Times Cited: 9
Phoenix
Roshan Dathathri, Gurbinder Gill, Loc Hoang, et al.
(2019), pp. 615-630
Open Access | Times Cited: 9
Exact Distributed Load Centrality Computation: Algorithms, Convergence, and Applications to Distance Vector Routing
Leonardo Maccari, Lorenzo Ghiro, Alessio Guerrieri, et al.
IEEE Transactions on Parallel and Distributed Systems (2020) Vol. 31, Iss. 7, pp. 1693-1706
Open Access | Times Cited: 8
Simple and Fast Distributed Computation of Betweenness Centrality
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
IEEE INFOCOM 2022 - IEEE Conference on Computer Communications (2020)
Open Access | Times Cited: 5
Efficient processing of coverage centrality queries on road networks
Yehong Xu, Mengxuan Zhang, Ruizhong Wu, et al.
World Wide Web (2024) Vol. 27, Iss. 3
Open Access
Computing Replacement Paths in the CONGEST Model
Vignesh Manoharan, Vijaya Ramachandran
Lecture notes in computer science (2024), pp. 420-437
Closed Access
EGGPU: Enabling Efficient Large-Scale Network Analysis with Consumer-Grade GPUs
Jia‐Wei Tang, M Y Gao, Yu Xiao, et al.
(2024), pp. 25-30
Closed Access
Attack-Resilient Distributed Optimization-based Control of Multi-Agent Systems with Dual Interaction Networks
Shanelle G. Clarke, Omanshu Thapliyal, Sounghwan Hwang, et al.
AIAA SCITECH 2022 Forum (2022)
Closed Access | Times Cited: 2
Page 1 - Next Page

Scroll to top