-
Article
Minimum-Cost Flows in Unit-Capacity Networks
We consider combinatorial algorithms for the minimum-cost flow problem on networks with unit capacities, and special cases of the problem. Historically, researchers have developed special-purpose algorithms th...
-
Chapter and Conference Paper
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
We introduce the Excesses Incremental Breadth-First Search (Excesses IBFS) algorithm for maximum flow problems. We show that Excesses IBFS has the best overall practical performance on real-world instances, while...
-
Chapter and Conference Paper
Maximum Flows by Incremental Breadth-First Search
Maximum flow and minimum s-t cut algorithms are used to solve several fundamental problems in computer vision. These problems have special structure, and standard techniques perform worse than the special-purpose...