Sentence examples for a maximum flow problem from inspiring English sources

We develop a minimum cost flow algorithm for the case in which demands may be split across multiple rings, and provide a transformation to a maximum flow problem for specially structured data.

We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon.

They transform the problem to a maximum flow problem so that it can be solved optimally in a centralized manner.

Replacing the association term in Equation (1) by a sum over pairs of SNPs rather than over individual SNPs results in a maximum flow problem over a fully connected network of SNPs, which cannot be solved straightforwardly, if only because the resulting adjacency matrix is too large to fit in memory on a regular computer.

However, existing TAG-related works only focus on solving the shortest path problem, and neither the correlation between time intervals nor nodes storage of a DTN are described in TAG, resulting in a non-trivial maximum flow problem in TAG.

As a dual of the min-cut problem, the maximum flow problem in conventional networks is solvable in polynomial time [30].

For solving the maximum flow problem of the DTN, an appropriate model should be built first.

When a delay constraint is imposed on each path, the maximum flow problem is NP-hard.

These results extend the classical minimum cost maximum flow problem and the minimum cut problem to a class of security games on flow networks.

The following are the constraints applied to specify the problem into the classical maximum flow problem [11]: The protein-protein interaction is a bi-directional edge.

We show that upon convergence, the steady-state voltages in the circuit capture the solution to the maximum flow problem.