A single-source shortest path algorithm for dynamic graphs
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, transportatio...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2020.01.002 |
| _version_ | 1818947014286639104 |
|---|---|
| author | Muteb Alshammari Abdelmounaam Rezgui |
| author_facet | Muteb Alshammari Abdelmounaam Rezgui |
| author_sort | Muteb Alshammari |
| collection | DOAJ |
| description | 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 single-source shortest path (SSSP) problem. Traditional solutions (based on Dijkstra’s algorithms) to the SSSP problem do not scale to large dynamic graphs with a high change frequency. In this paper, we propose an efficient SSSP algorithm for large dynamic graphs. We first present our algorithm and give a formal proof of its correctness. Then, we give an analytical evaluation of the proposed solution. |
| first_indexed | 2024-12-20T08:24:10Z |
| format | Article |
| id | doaj.art-79668f04b3b3445cbbb8134998ae906a |
| institution | Directory Open Access Journal |
| issn | 0972-8600 2543-3474 |
| language | English |
| last_indexed | 2024-12-20T08:24:10Z |
| publishDate | 2020-09-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | AKCE International Journal of Graphs and Combinatorics |
| spelling | doaj.art-79668f04b3b3445cbbb8134998ae906a2022-12-21T19:46:53ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742020-09-011731063106810.1016/j.akcej.2020.01.0021740016A single-source shortest path algorithm for dynamic graphsMuteb Alshammari0Abdelmounaam Rezgui1New Mexico TechIllinois State UniversityGraphs 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 single-source shortest path (SSSP) problem. Traditional solutions (based on Dijkstra’s algorithms) to the SSSP problem do not scale to large dynamic graphs with a high change frequency. In this paper, we propose an efficient SSSP algorithm for large dynamic graphs. We first present our algorithm and give a formal proof of its correctness. Then, we give an analytical evaluation of the proposed solution.http://dx.doi.org/10.1016/j.akcej.2020.01.002dynamic graphsshortest pathssssp |
| spellingShingle | Muteb Alshammari Abdelmounaam Rezgui A single-source shortest path algorithm for dynamic graphs AKCE International Journal of Graphs and Combinatorics dynamic graphs shortest paths sssp |
| title | A single-source shortest path algorithm for dynamic graphs |
| title_full | A single-source shortest path algorithm for dynamic graphs |
| title_fullStr | A single-source shortest path algorithm for dynamic graphs |
| title_full_unstemmed | A single-source shortest path algorithm for dynamic graphs |
| title_short | A single-source shortest path algorithm for dynamic graphs |
| title_sort | single source shortest path algorithm for dynamic graphs |
| topic | dynamic graphs shortest paths sssp |
| url | http://dx.doi.org/10.1016/j.akcej.2020.01.002 |
| work_keys_str_mv | AT mutebalshammari asinglesourceshortestpathalgorithmfordynamicgraphs AT abdelmounaamrezgui asinglesourceshortestpathalgorithmfordynamicgraphs AT mutebalshammari singlesourceshortestpathalgorithmfordynamicgraphs AT abdelmounaamrezgui singlesourceshortestpathalgorithmfordynamicgraphs |