Imagine you are using the European transportation network and looking for the fastest and cheapest route to move as many goods as possible from Copenhagen to Milan. Kyng's algorithm can be applied ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

Once refined, the new algorithm could potentially be applied to a number of applications, including internet data, airline scheduling and improving the efficiencies of markets, the researchers said.