Author:
Ajwani Deepak,Meyer Ulrich,Veith David
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)
2. Ajwani, D.: Traversing large graphs in realistic setting. PhD thesis, Saarland University (2008)
3. Ajwani, D., Beckmann, A., Meyer, U., Veith, D.: I/O-efficient approximation of graph diameters by parallel cluster growing – A first experimental study. In: 10th Workshop on Parallel Systems and Algorithms, PASA (2012)
4. Ajwani, D., Meyer, U., Osipov, V.: Improved external memory BFS implementation. In: Proc. 9th ALENEX, pp. 3–12 (2007)
5. Lecture Notes in Computer Science;L. Arge,2004
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Evaluation of Parallel Eccentricity Estimation Algorithms on Undirected Real-World Graphs;Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining;2015-08-10
2. Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation;Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures;2015-06-13