Before revision: We provide new algorithms for maintaining approximate distances in a weighted undirected graph G=(V,E ) subject to edge deletions.
After revision: Given a weighted undirected graph G=(V,E ) subject to edge deletions.