Results 171 to 180 of about 119,914 (208)

Maximum Flow in Planar Networks

SIAM Journal on Computing, 1979
Efficient algorithms for finding maximum flow in planar networks are presented. These algorithms take advantage of the planarity and are superior to the most efficient algorithms to date. If the source and the terminal are on the same face, an algorithm of Berge is improved and its time complexity is reduced to $O(n\log n)$.
Alon Itai, Yossi Shiloach
openaire   +1 more source

Maximum flows in probabilistic networks

Networks, 1991
AbstractThe reliability of capacitated networks subject to random arc failures is evaluated by the expected value of maximum flow. It is known that calculating the expected value of maximum flow is NP‐hard, but a lower bound can be efficiently computed by the method of Carey and Hendrickson.
Hiroshi Nagamochi, Toshihide Ibaraki
openaire   +1 more source

Decentralized maximum‐flow protocols

Networks, 1982
AbstractThis article presents three protocols for obtaining maximum flow in a network by using distributed computation. Each node in the network has memory and processing capabilities and coordinates the algorithm with its neighbors by means of control messages. In the order presented, each protocol employs less communication than the previous one, but
openaire   +1 more source

The maximum concurrent flow problem

Journal of the ACM, 1990
The 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, 2014
Though 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, 1977
Microcatheters 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

An Incremental Algorithm for the Maximum Flow Problem

Journal of Mathematical Modelling and Algorithms, 2003
zbMATH 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, 1988
Consider 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, 1994
Summary: 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, S. Rao, Robert Endre Tarjan   +2 more
openaire   +3 more sources

Computing and Applications: The Maximum Flow and Minimum Cost – Maximum Flow Problems

2021
The 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