3 citations · 4 across the 6 of their papers we have counts for
1 paper · 1 filter
Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg +2
Maintaining and updating shortest paths information in a graph is a fundamental problem with many applications. As computations on dense graphs can be prohibitively expensive, and…