52 citations · 107 across the 10 of their papers we have counts for
1 paper · 1 filter
Michael J. Bannister, David Eppstein
We describe a variant of the Bellman-Ford algorithm for single-source shortest paths in graphs with negative edges but no negative cycles that randomly permutes the vertices and us…