A single-source shortest path algorithm for dynamic graphs

DOI10.1016/j.akcej.2020.01.002zbMath1471.05029OpenAlexW3044629247MaRDI QIDQ4956230

Muteb Alshammari, Abdelmounaam Rezgui

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2020.01.002

zbMATH Keywords

shortest pathsdynamic graphsSSSP

Mathematics Subject Classification ID

Applications of graph theory (05C90) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• On the computational complexity of dynamic graph problems
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Shortest Path Tree Computation in Dynamic Graphs
• Power balance and apportionment algorithms for the United States Congress

This page was built for publication: A single-source shortest path algorithm for dynamic graphs