Results 271 to 280 of about 1,228,420 (310)
Some of the next articles are maybe not open access.
The maximum concurrent flow problem
Journal of the ACM, 1990The maximum concurrent flow problem (MCFP) is a multicommodity flow problem in which every pair of entities can send and receive flow concurrently. The ratio of the flow supplied between a pair of entities to the predefined demand for that pair is called throughput and must be the same for all pairs of entities for ...
Farhad Shahrokhi, David W. Matula
openaire +1 more source
Efficient maximum flow algorithms
Communications of the ACM, 2014Though maximum flow algorithms have a long history, revolutionary progress is still being made.
Andrew V. Goldberg, Robert Endre Tarjan
openaire +1 more source
Maximum Flow Rates for Microcatheters
Radiology, 1977Microcatheters are defined as those with outer diameters of 4 French gauge or less. Authors tested five sizes of catheters from 2 to 4 French, inclusive to determine the bursting and maximum safe flow rates with automatic injectors. This communication describes the maximum flow rates for various sizes and lenghts, as well as the feasibility of ...
R L, Mani, M J, Kellett
openaire +2 more sources
1995
We introduce the maximum skew-symmetric flow problem which generalizes flow and matching problems. We develop a theory of skew-symmetric flows that is parallel to the classical flow theory. We use the newly developed theory to extend, in a natural way, the blocking flow method of Dinitz to the skew-symmetric flow case.
Andrew V. Goldberg +1 more
openaire +1 more source
We introduce the maximum skew-symmetric flow problem which generalizes flow and matching problems. We develop a theory of skew-symmetric flows that is parallel to the classical flow theory. We use the newly developed theory to extend, in a natural way, the blocking flow method of Dinitz to the skew-symmetric flow case.
Andrew V. Goldberg +1 more
openaire +1 more source
An Incremental Algorithm for the Maximum Flow Problem
Journal of Mathematical Modelling and Algorithms, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Kumar, P. Gupta
openaire +2 more sources
On the Maximum Expected Flow in a Network
Journal of the Operational Research Society, 1988Consider a graph G in which every arc(i,j) has two numbers, \(\rho_{ij}\) and \(c_{ij}\), associated with it representing the reliability and capacity of the arc respectively. It is shown that the expected flow is equal to the sum of the expected capacities of the paths from source to sink. An algorithm is described to find the maximum expected flow in
openaire +1 more source
A Faster Deterministic Maximum Flow Algorithm
Journal of Algorithms, 1994Summary: Cheriyan and Hagerup (1989) developed a randomized algorithm to compute the maximum flow in a graph with \(n\) nodes and \(m\) edges in \(O(mn + n^2 \log^2 n)\) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation.
Valerie King +2 more
openaire +3 more sources
Computing and Applications: The Maximum Flow and Minimum Cost – Maximum Flow Problems
2021The maximum flow and minimum cost-maximum flow problems are both concerned with determining flows through a network between a source and a destination. Maximum flow applies to any problem where the objective is move as many as possible goods/objects/people between two locations via intermediate locations.
openaire +2 more sources
Target Controllability in Multilayer Networks via Minimum-Cost Maximum-Flow Method
IEEE Transactions on Neural Networks and Learning Systems, 2021Jie Ding, Changyun Wen, Guoqi Li
exaly