Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 -
2 of
2
A new approach to the maximum flow problem
- JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length 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
on the preflow concept of Karzanov is introduced. A preflow is like a flow, except that the total amount flowing into a vertex is allowed to exceed the total amount flowing out. The method maintains a preflow in the original network and pushes local flow excess toward the sink along what are estimated
Chapter 1 Network Flow- COMP 5703 Course Note Update
"... The Push-Relabel, or Preflow-Push, Maximum-Flow algorithm was originally developed by Andrew V. Goldberg and Robert E. Tarjan in the mid-to-late 1980s, [2, 3]. This Push-Relabel algorithm is unlike the previous Ford-Fulkerson and Edmonds-Karp algorithms which use the concept of an augmenting path to ..."
Abstract
- Add to MetaCart
The Push-Relabel, or Preflow-Push, Maximum-Flow algorithm was originally developed by Andrew V. Goldberg and Robert E. Tarjan in the mid-to-late 1980s, [2, 3]. This Push-Relabel algorithm is unlike the previous Ford-Fulkerson and Edmonds-Karp algorithms which use the concept of an augmenting path
