2 citations · 2 across the 1 of their papers we have counts for
1 paper
Nairen Cao, Jeremy T. Fineman, Katina Russell
The approximate single-source shortest-path problem is as follows: given a graph with nonnegative edge weights and a designated source vertex s, return estimates of the distances…