Researchers Achieve ‘Absurdly Fast’ Algorithm for Network Flow

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 network from a source to a destination if the links in the network have capacity limits.

Read the full article at: www.quantamagazine.org