A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
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-leveldblp:conf/ictcs/DEmidioF14 fatcat:icoz7ylnsneabmxj5ikauskdla