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 |