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

The maximum ow solver is di fficult to parallelize. Highly optimized sequential version of maximum flow solvers such as those by Goldberg exists. This work describes how some of the concurrency ...

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.