9 citations · 9 across the 1 of their papers we have counts for
1 paper
Aaron Bernstein
In this paper we consider the decremental single-source shortest paths (SSSP) problem, where given a graph G and a source node s the goal is to maintain shortest distances betw…