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:
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
Alexander van der Grinten, Henning Meyerhenke
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2020)
Open Access | Times Cited: 9
Showing 9 citing articles:
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
Tianming Zhang, Yunjun Gao, Jie Zhao, et al.
Proceedings of the ACM Web Conference 2022 (2024), pp. 2395-2406
Closed Access | Times Cited: 4
Scaling up network centrality computations – A brief overview
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
it - Information Technology (2020) Vol. 62, Iss. 3-4, pp. 189-204
Closed Access | Times Cited: 16
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
it - Information Technology (2020) Vol. 62, Iss. 3-4, pp. 189-204
Closed Access | Times Cited: 16
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
Rishi Ranjan Singh
Smart innovation, systems and technologies (2021), pp. 1-27
Closed Access | Times Cited: 15
Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit
Eugenio Angriman, Alexander van der Grinten, Michael Hamann, et al.
Lecture notes in computer science (2022), pp. 3-20
Open Access | Times Cited: 10
Eugenio Angriman, Alexander van der Grinten, Michael Hamann, et al.
Lecture notes in computer science (2022), pp. 3-20
Open Access | Times Cited: 10
Computing Betweenness Centrality in Link Streams
Frédéric Simard, Clémence Magnien, Matthieu Latapy
Journal of Graph Algorithms and Applications (2023) Vol. 27, Iss. 3, pp. 195-217
Open Access | Times Cited: 6
Frédéric Simard, Clémence Magnien, Matthieu Latapy
Journal of Graph Algorithms and Applications (2023) Vol. 27, Iss. 3, pp. 195-217
Open Access | Times Cited: 6
A multi-node attack scheme based on community partitioning in large scale infrastructure networks
Beibei Li, Wei Hu
Computer Networks (2024) Vol. 245, pp. 110386-110386
Closed Access | Times Cited: 1
Beibei Li, Wei Hu
Computer Networks (2024) Vol. 245, pp. 110386-110386
Closed Access | Times Cited: 1
Fast cluster-based computation of exact betweenness centrality in large graphs
Cecile Daniel, Angelo Furno, Lorenzo Goglia, et al.
Journal Of Big Data (2021) Vol. 8, Iss. 1
Open Access | Times Cited: 10
Cecile Daniel, Angelo Furno, Lorenzo Goglia, et al.
Journal Of Big Data (2021) Vol. 8, Iss. 1
Open Access | Times Cited: 10
SaPHyRa: A Learning Theory Approach to Ranking Nodes in Large Networks
Phuc Thai, My T. Thai, Tam Vu, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022), pp. 54-67
Open Access | Times Cited: 4
Phuc Thai, My T. Thai, Tam Vu, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022), pp. 54-67
Open Access | Times Cited: 4
Computing Betweenness Centrality in Link Streams
Frédéric Simard, Clémence Magnien, Matthieu Latapy
arXiv (Cornell University) (2021)
Open Access | Times Cited: 2
Frédéric Simard, Clémence Magnien, Matthieu Latapy
arXiv (Cornell University) (2021)
Open Access | Times Cited: 2
