Kin's algorithm can quickly calculate the optimal transportation flow for all kinds of networks, including not only the transportation of goods by rail and road, but also water and the Internet.

Algorithm promises to greatly streamline solutions to the 'max flow' problem. Research could boost the efficiency even of huge networks like the Internet. Finding the most efficient way to ...

New Algorithm Can Dramatically Streamline Solutions to the ‘Max Flow’ Problem Research could boost the efficiency of even huge networks like the Internet.

The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...