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â€¦ (More)

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â€¦ (More)

We consider the minimum cost flow problem on graphs with unit capacities and its special cases. In previous studies, special purpose algorithms exploiting the fact that capacities are one have beenâ€¦ (More)

We would like that a person A would be able to generate message-signature pairs (m, t) such that everyone could verify that the message indeed originated from A, and additionally no verifier will beâ€¦ (More)

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â€¦ (More)