In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

So all shortest paths must be of length at most k. <BR><BR>One solution, which works well for small k, is to run the Bellman-Ford algorithm (slightly modified) for k steps. This takes O (km) time.

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 ...