In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

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