Abstract
Graphs are mathematical structures used in many applications. In recent years, many applications emerged that require the processing of large dynamic graphs where the graph's structure and properties change constantly over time. Examples include social networks, communication networks, transportation networks, etc. One of the most challenging problems in large scale dynamic graphs is the all-pairs, shortest path (APSP) problem. Traditional solutions (based on Dijkstra's algorithms) to the APSP problem do not scale to large dynamic graphs with a high change frequency. In this paper, we propose an efficient APSP algorithm for large sparse dynamic graphs. We first present our algorithm and then we give an analytical evaluation of the proposed solution. We also present a thorough experimental study of our solution and compare it to two of the best known algorithms in the literature.