Efficient Maintenance of All-Pairs Shortest Distances
Sergio Greco, Cristian Molinaro, Chiara Pulice · 2016
Computing shortest distances is a central task in many graph applications. Since it is impractical to recompute shortest distances from scratch every time the graph changes, many algorithms have been proposed to incrementally maintain shortest distances after edge deletions or insertions.