Researchers have combined the Dijkstra and Bellman-Ford algorithms to develop an even faster way to find the shortest paths in a network.

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.

This is a preview. Log in through your library . Journal Information The Mathematical Gazette is the original journal of the Mathematical Association and it is now over a century old. Its readership ...