A transportation flow algorithm is, for example, an algorithm that finds the fastest and cheapest route to transport as many goods as possible from Tokyo to Osaka.

We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several ...

In this paper, for a degraded two-colour or binary scene, we show how the image with maximum a posteriori (MAP) probability, the MAP estimate, can be evaluated exactly using efficient variants of the ...