Skip to search formSkip to main contentSkip to account menu

Push–relabel maximum flow algorithm

Known as: Push-relabel maximum flow algorithm, Lift to front, Push-relabel algorithm 
In mathematical optimization, the push–relabel algorithm (alternatively, preflow–push algorithm) is an algorithm for computing maximum flows. The… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Andrew V. GoldbergBreadth-first searchEdmonds–Karp algorithmFIFO (computing and electronics)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A Network-flow Based Optimal Scheduling for Data Downloading from Satellites to ES in LEO Satellite Networks
In recent years, satellite networks technology plays a more and more important role in military and commercial fields. To meet… 
2014
2014
Surface Detection in 3D images using Cellular Logic Array Processing
This paper proposes Cellular Logic Array Processing (CLAP) based 3-D surface detection algorithm. The performance of CLAP based… 
Highly Cited
2010
Highly Cited
2010
Distributed routing algorithms to manage power flow in agent-based active distribution network
The current transition from passive to active electric distribution networks comes with problems and challenges on bi-directional… 
2010
2010
Dynamically tuned push-relabel algorithm for the maximum flow problem on CPU-GPU-Hybrid platforms
The maximum flow problem is a fundamental graph theory problem with many important applications. Max-flow algorithms based on the… 
2009
2009
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm… 
Highly Cited
2008
Highly Cited
2008
CUDA cuts: Fast graph cuts on the GPU
Graph cuts has become a powerful and popular optimization tool for energies defined over an MRF and have found applications in… 
2008
2008
The Partial Augment-Relabel Algorithm for the Maximum Flow Problem
The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient… 
2008
2008
A lock-free multi-threaded algorithm for the maximum flow problem
  • Bo Hong
  • IEEE International Symposium on Parallel and…
  • 2008
  • Corpus ID: 2565199
The maximum flow problem is an important graph problem with a wide range of applications. In this paper, we present a lock-free… 
2007
2007
Maximum s-t-flow with k crossings in O(k3n log n) time
There is a large body of results on planar graph algorithms that are more efficient than the best known algorithm for general… 
1995
1995
A Parallel Implementation of the Push-Relabel Algorithm for the Maximum Flow Problem
Abstract We describe an efficient parallel implementation of the push-relabel maximum flow algorithm for a shared-memory… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)