Results 1  10
of
9,053
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based
Maximum Flow
"... Imagine that you are a courier service, and you want to deliver some cargo from one city to another. You can deliver them using various flights from cities to cities, but each flight has a limited amount of space that you can use. An important question is, how much of our cargo can be shipped to the ..."
Abstract
 Add to MetaCart
assume there can only be one edge (u,v) for vertices u and v, but we do allow reverse edges (v,u). With this graph, we now want to know how much cargo we can ship from s to t. Since the cargo "flows " through the graph from s to t, we call this the maximum flow problem. A
On implementing the pushrelabel method for the maximum flow problem
, 1994
"... We study efficient implementations of the pushrelabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementation. We also exhibit a family of p ..."
Abstract

Cited by 209 (10 self)
 Add to MetaCart
We study efficient implementations of the pushrelabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementation. We also exhibit a family
A MaximumFlow Formulation of the Ncamera Stereo Correspondence Problem
, 1998
"... This paper describes a new algorithm for solving the Ncamera stereo correspondence problem by transforming it into a maximumflow problem. Once solved, the minimumcut associated to the maximumflow yields a disparity surface for the whole image at once. This global approach to stereo analysis provi ..."
Abstract

Cited by 258 (4 self)
 Add to MetaCart
This paper describes a new algorithm for solving the Ncamera stereo correspondence problem by transforming it into a maximumflow problem. Once solved, the minimumcut associated to the maximumflow yields a disparity surface for the whole image at once. This global approach to stereo analysis
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
COMBINATORIAL CONTINUOUS MAXIMUM FLOW
, 2011
"... Maximum flow (and minimumcut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching an ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Maximum flow (and minimumcut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching
Reducing The Maximum Flow
, 2012
"... We study two problems in which the goal is to reduce the maximum st flow in a flow network, while paying the minimum cost. In the first problem, only one edge can be removed, and the goal is to remove an edge with the minimum cost whose removal decreases the maximum st flow. This problem is in P, ..."
Abstract
 Add to MetaCart
We study two problems in which the goal is to reduce the maximum st flow in a flow network, while paying the minimum cost. In the first problem, only one edge can be removed, and the goal is to remove an edge with the minimum cost whose removal decreases the maximum st flow. This problem is in P
Anabranching and maximum flow efficiency in
, 2004
"... Anabranching and maximum flow efficiency in Magela Creek, northern Australia [1] Anabranching is the prevailing river pattern found along alluvial tracts of the world's largest rivers. Hydraulic geometry and bed material discharge are compared between single channel and anabranching reaches up ..."
Abstract
 Add to MetaCart
Anabranching and maximum flow efficiency in Magela Creek, northern Australia [1] Anabranching is the prevailing river pattern found along alluvial tracts of the world's largest rivers. Hydraulic geometry and bed material discharge are compared between single channel and anabranching reaches up
Maximum Flows on Disjoint Paths
, 2010
"... Abstract. We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a maximum weighted packing of disjoint paths, where the weight of a path is the minimum capacity of an edge on ..."
Abstract
 Add to MetaCart
Abstract. We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a maximum weighted packing of disjoint paths, where the weight of a path is the minimum capacity of an edge
Results 1  10
of
9,053