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:

Partitioning dynamic graph asynchronously with distributed FENNEL
Zhan Shi, Junhao Li, Pengfei Guo, et al.
Future Generation Computer Systems (2017) Vol. 71, pp. 32-42
Closed Access | Times Cited: 11

Showing 11 citing articles:

A study of partitioning policies for graph analytics on large-scale distributed platforms
Gurbinder Gill, Roshan Dathathri, Loc Hoang, et al.
Proceedings of the VLDB Endowment (2018) Vol. 12, Iss. 4, pp. 321-334
Closed Access | Times Cited: 26
Practice of Streaming and Dynamic Graphs: Concepts, Models, Systems, and Parallelism.
Maciej Besta, Marc Fischer, Vasiliki Kalavri, et al.
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 23
An investigation of big graph partitioning methods for distribution of graphs in vertex-centric systems
Nasrin Mazaheri Soudani, Afsaneh Fatemi, Mohammad Ali Nematbakhsh
Distributed and Parallel Databases (2019) Vol. 38, Iss. 1, pp. 1-29
Closed Access | Times Cited: 17
Partitioning big graph with respect to arbitrary proportions in a streaming manner
Kekun Hu, Guosun Zeng, Huowen Jiang, et al.
Future Generation Computer Systems (2017) Vol. 80, pp. 1-11
Closed Access | Times Cited: 14
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
Maciej Besta, Marc Fischer, Vasiliki Kalavri, et al.
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 11
TSH: Easy-to-be distributed partitioning for large-scale graphs
Ning Wang, Zhigang Wang, Yu Gu, et al.
Future Generation Computer Systems (2019) Vol. 101, pp. 804-818
Closed Access | Times Cited: 9
Lightweight Streaming Graph Partitioning by Fully Utilizing Knowledge from Local View
Zhigang Wang, Zichao Yang, Ning Wang, et al.
(2023), pp. 614-625
Closed Access | Times Cited: 2
RBSEP: a reassignment and buffer based streaming edge partitioning approach
Monireh Taimouri, Hamid Saadatfar
Journal Of Big Data (2019) Vol. 6, Iss. 1
Open Access | Times Cited: 4
HaSGP: an effective graph partition method for heterogeneous-aware
Ying Zhong, Chenze Huang, Qingbiao Zhou
Computing (2022) Vol. 105, Iss. 2, pp. 455-481
Closed Access | Times Cited: 1
The major challenges of big graph and their solutions: A review
Fitsum Gebreegziabher, Ripon Patgiri
Advances in computers (2023), pp. 399-421
Closed Access
Dynamic Partition of Large Graphs Combining Local Nodes Exchange with Directed Dynamic Maintenance
Xiaohuan Shan, Xiyi Shi, Yulong Song, et al.
Lecture notes in computer science (2020), pp. 441-453
Closed Access
Page 1

Scroll to top