This algorithm solves the minimum-cost maximum-flow problem for networks that incrementally change as new connections are added.

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 ...