"Maintaining shortest paths under deletions in weighted directed graphs: ..."

Aaron Bernstein (2013)
a service of  Schloss Dagstuhl - Leibniz Center for Informatics