Shortest paths on dynamic graphs

Giacomo Nannicini, Leo Liberti
2008 International Transactions in Operational Research  
Among the variants of the well known shortest path problem, those that refer to a dynamically changing graphs are theoretically interesting, as well as computationally challenging. Applicationwise, there is an industrial need for computing point-to-point shortest paths on large-scale road networks whose arcs are weighted with a travelling time which depends on traffic conditions. We survey recent techniques for dynamic graph weights as well as dynamic graph topology.
doi:10.1111/j.1475-3995.2008.00649.x fatcat:77jh6um4fbc35eihpu4xcd4bf4