@inproceedings{be0c06b283bf4aa694f3d152e940bfc3,
title = "Single-Source Shortest Path Tree for Big Dynamic Graphs",
abstract = "Computing single-source shortest paths (SSSP) is one of the fundamental problems in graph theory. There are many applications of SSSP including finding routes in GPS systems and finding high centrality vertices for effective vaccination. In this paper, we focus on calculating SSSP on big dynamic graphs, which change with time. We propose a novel distributed computing approach, SSSPIncJoint, to update SSSP on big dynamic graphs using GraphX. Our approach considerably speeds up the recomputation of the SSSP tree by reducing the number of map-reduce operations required for implementing SSSP in the gather-apply- scatter programming model used by GraphX.",
keywords = "Apache Spark, Big Dynamic Graphs, Map- Reduce, Single-Source Shortest Path (SSSP)",
author = "Sara Riazi and Sriram Srinivasan and Das, {Sajal K.} and Sanjukta Bhowmick and Boyana Norris",
note = "Funding Information: Sanjukta Bhowmick and Sriram Srinivasan are supported by the NSF CCF Award #1533881 and #1725566. Boyana Norris and Sara Riazi are supported by the NSF CCF Award #1725585. Sajal Das is supported by the NSF CCF Awards #1533918 and #1725755. Publisher Copyright: {\textcopyright} 2018 IEEE.; 2018 IEEE International Conference on Big Data, Big Data 2018 ; Conference date: 10-12-2018 Through 13-12-2018",
year = "2019",
month = jan,
day = "22",
doi = "10.1109/BigData.2018.8622042",
language = "English (US)",
series = "Proceedings - 2018 IEEE International Conference on Big Data, Big Data 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "4054--4062",
editor = "Yang Song and Bing Liu and Kisung Lee and Naoki Abe and Calton Pu and Mu Qiao and Nesreen Ahmed and Donald Kossmann and Jeffrey Saltz and Jiliang Tang and Jingrui He and Huan Liu and Xiaohua Hu",
booktitle = "Proceedings - 2018 IEEE International Conference on Big Data, Big Data 2018",
}