Before revision: We provide new algorithms for maintaining approximate distances in a weighted undirected graph G=(V,E ) subject to edge deletions. Our first result is an algorithm that maintains (1+\epsilon) -approximate distances from a set of s sources in (sm) total update time , assuming that s= n^{\Omega(1), \epsilon = \Omega(1) and |E|= n^{1+\Omega(1)}.
After revision: We provide new algorithms for maintaining approximate distances in a weighted undirected graph G=(V,E ,w), a hopset H of hopbound \beta and stretch (1+\epsilon) -approximate distances from a set of s sources in (sm) total update time , assuming that s= n^{\Omega(1), \epsilon = \Omega(1) and |E|= n^{1+\Omega(1)}.