Solving All-Pairs Shortest-Paths Problem in Large Graphs Using Apache Spark-Reference-Cited by-同舟云学术

Solving All-Pairs Shortest-Paths Problem in Large Graphs Using Apache Spark

Published:2019-08-05 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 48th International Conference on Parallel Processing
language:
Short-container-title:

Author:

Schoeneman Frank¹,Zola Jaroslaw²

Affiliation:

1. Department of Computer Science & Engineering, University at Buffalo, Buffalo, New York

2. Department of Computer Science & Engineering, Department of Biomedical Informatics, University at Buffalo, Buffalo, New York

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3337821.3337852

Reference27 articles.

1. 2019. Tuning Spark. https://spark.apache.org/docs/latest/tuning.html. 2019. Tuning Spark. https://spark.apache.org/docs/latest/tuning.html.

2. D. Abrahams and R.W. Grosse-Kunstleve. 2003. Building Hybrid Systems with Boost.Python. C/C++ Users Journal 21 7 (2003) 29--36. D. Abrahams and R.W. Grosse-Kunstleve. 2003. Building Hybrid Systems with Boost.Python. C/C++ Users Journal 21 7 (2003) 29--36.

3. M. Bernstein V. de Silva J.C. Langford and J.B. Tenenbaum. 2000. Graph Approximations to Geodesics on Embedded Manifolds. M. Bernstein V. de Silva J.C. Langford and J.B. Tenenbaum. 2000. Graph Approximations to Geodesics on Embedded Manifolds.

4. Shortest-Path Kernels on Graphs

5. T.H. Cormen C.E. Leiserson R.L. Rivest and C. Stein. 2009. Introduction to Algorithms. MIT press. T.H. Cormen C.E. Leiserson R.L. Rivest and C. Stein. 2009. Introduction to Algorithms. MIT press.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enhanced OpenMP Algorithm to Compute All-Pairs Shortest Path on X86 Architectures;Communications in Computer and Information Science;2024

2. Link prediction in multiplex networks using intralayer probabilistic distance and interlayer co-evolving factors;Physica A: Statistical Mechanics and its Applications;2022-11