15 citations · 42 across the 8 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 5 cited
Fully Dynamic All Pairs All Shortest Paths
Matteo Pontecorvi, Vijaya Ramachandran
We consider the all pairs all shortest paths (APASP) problem, which maintains all of the multiple shortest paths for every vertex pair in a directed graph with a positive…
cs.DS2014★ 1 cited
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights. F…