96 citations · 96 across the 1 of their papers we have counts for
1 paper
Michael P. Wellman, Matthew Ford, Kenneth Larson
Standard algorithms for finding the shortest path in a graph require that the cost of a path be additive in edge costs, and typically assume that costs are deterministic. We consid…