This is a preview. Log in through your library . Abstract In this note we present some computational evidence to suggest that a version of Bellman's shortest-path algorithm outperforms ...

Here is a problem I'm working on. Say you have a weighted, directed graph with n vertices and m edges, and you want to find the shortest path from s to all other vertices, *but* you can only use some ...