Two mathematicians have proved that a straightforward question—how hard is it to untie a knot?—has a complicated answer.

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