Author:
Zhang Yongzhe,Ko Hsiang-Shang,Hu Zhenjiang
Publisher
Springer International Publishing
Reference17 articles.
1. Chung, S., Condon, A.: Parallel implementation of Borůvka’s minimum spanning tree algorithm. In: IPPS, pp. 302–308. IEEE (1996)
2. Emoto, K., Matsuzaki, K., Morihata, A., Hu, Z.: Think like a vertex, behave like a function! A functional DSL for vertex-centric big graph processing. In: ICFP, pp. 200–213. ACM (2016)
3. Fard, A., Nisar, M.U., Ramaswamy, L., Miller, J.A., Saltz, M.: A distributed vertex-centric approach for pattern matching in massive graphs. In: BigData, pp. 403–411. IEEE (2013)
4. Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. J. Comput. System Sci. 30(2), 209–221 (1985)
5. Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. J. ACM 37(3), 549–587 (1990)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Grafs: declarative graph analytics;Proceedings of the ACM on Programming Languages;2021-08-22