The aim of this paper is to apply the method of pseudo-Boolean programming to the determination of the minimal cut and of the value of the maximal flow through a network without, or with, given lower ...
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 ...
The European PRACE organization has published a series of excellent whitepapers on scalable algorithms. Produced as part of the Work Package 8 of the PRACE 1IP Project, the most recent paper is ...
The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback