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

With Kin's algorithm, all important network flow problems, including maximum flow and minimum cost problems, can now be treated as special cases of the minimum cost flow problem.

Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...

Algorithm promises to greatly streamline solutions to the 'max flow' problem.

Produced as part of the Work Package 8 of the PRACE 1IP Project, the most recent paper is entitled: Experiences with Parallel Multi-threaded Network Maximum Flow Algorithm. The problem of computing ...