Author:
Kyrola Aapo,Shun Julian,Blelloch Guy
Publisher
Springer International Publishing
Reference21 articles.
1. Abello, J., Buchsbaum, A.L., Westbrook, J.R.: A functional approach to external graph algorithms. Algorithmica 32(3), 437–458 (2002)
2. Aggarwal, A., Vitter, J., et al.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116–1127 (1988)
3. Arge, L., Brodal, G.S., Toma, L.: On external-memory MST, SSSP and multi-way planar graph separation. J. Algorithms 53(2), 186–206 (2004)
4. Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group formation in large social networks: Membership, growth, and evolution. In: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 44–54. ACM, New York (2006)
5. Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Upper Saddle River (1989)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient Out-of-Core Contig Generation;Advances in Bioinformatics and Computational Biology;2020
2. BlockGraphChi: Enabling Block Update in Out-of-Core Graph Processing;International Journal of Parallel Programming;2017-10-23
3. Is Your Graph Algorithm Eligible for Nondeterministic Execution?;2015 44th International Conference on Parallel Processing;2015-09
4. A simple and practical linear-work parallel algorithm for connectivity;Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures;2014-06-21