Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.

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