Abstract:In the decremental single-source shortest paths (SSSP) problem, the input is an undirected graph G = (V, E) with n vertices and m edges undergoing edge deletions, together with a fixed source vertex s ∈ V . The goal is to maintain a data structure that supports shortest-path queries: given a vertex v ∈ V , quickly return an (approximate) shortest path from s to v. The decremental all-pairs shortest paths (APSP) problem is defined similarly, but now the shortest-path queries are allowed between any pair of vert… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.