Engineering shortest-path algorithms for dynamic networks

Mattia D'Emidio, Daniele Frigioni
2014 Italian Conference on Theoretical Computer Science  
The problem of updating shortest paths in networks whose topology dynamically changes over time is a core functionality of many nowadays networked systems. In fact, the problem finds application in many real-world scenarios such as Internet routing and route planning in road networks. In these scenarios, shortest-path data are stored in different ways and have to be updated whenever the underlying graph, representing the network, undergoes dynamic updates. This paper provides a top-level
more » ... w of [13] , where new dynamic shortest-path algorithms for various real-world applications are proposed, engineered, analyzed and compared to the literature, both theoretically and experimentally.
dblp:conf/ictcs/DEmidioF14 fatcat:icoz7ylnsneabmxj5ikauskdla