Author:
Liu Xinyi,Wang Zhigang,Wang Ning,Li Xiangtan,Zhang Bo,Qiao Jun,Wei Zhiqiang,Nie Jie
Publisher
Springer International Publishing
Reference17 articles.
1. Then, M., et al.: The more the merrier: efficient multi-source graph traversal. Proc. VLDB Endow. 8(4), 449–460 (2014)
2. Then, M., Günnemann, S., Kemper, A., Neumann, T.: Efficient batched distance, closeness and betweenness centrality computation in unweighted and weighted graphs. Datenbank-Spektrum 17(2), 169–182 (2017)
3. Kaufmann, M., Then, M., Kemper, A., Neumann, T.: Parallel array-based single-and multi-source breadth first searches on large dense graphs. In: EDBT, pp. 1–12 (2017)
4. Shen, D.: Lower bounds on rate of convergence of matrix products in all pairs shortest path of social network. arXiv preprint arXiv:2006.13412 (2020)
5. Kang, S.J., Lee, S.Y., Lee, K.M.: Performance comparison of OpenMP, MPI, and MapReduce in practical problems. In: Advances in Multimedia 2015 (2015)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献