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.
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… 
2012
2012
Introducing mass balancing theorem for network flow maximization
Article history: Received 27 March 2012 Received in revised format 31 May 2012 Accepted June 8 2012 Available online 9 June 2012… 
2011
2011
Parallel algorithms for bipartite matching problems on distributed memory computers
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… 
2007
2007
Subgoal Identification for Reinforcement Learning and Planning in Multiagent Problem Solving
We provide a new probability flow analysis algorithm to automatically identify subgoals in a problem space. Our flow analysis… 
2006
2006
A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
Given a graph G and degree bound B on its nodes, the bounded-degree minimum spanning tree (BDMST) problem is to find a minimum… 
2005
2005
Geographic On-Demand Disjoint Multipath Routing in Wireless Ad Hoc Networks
Multipath routing in ad hoc networks is a challenging problem. In this paper, we present a new approach to the problem of finding… 
2005
2005
GPU-Cuts : Combinatorial Optimisation , Graphic Processing Units and Adaptive Object Extraction GPU-Cuts : Segmentation d ’ Objects par Optimisation Combinatoire sur Processeur Graphique
Object extraction is a core component of computer vision with application to segmentation, tracking, etc. In this paper we… 
2004
2004
Performance optimization of a de-centralized task allocation protocol via bandwidth and buffer management
  • Bo HongV. Prasanna
  • Proceedings of the Second International Workshop…
  • 2004
  • Corpus ID: 14863153
Sharing the resources among various users and the lack of a centralized control are two key characteristics of many distributed… 
2000
2000
A fast cost scaling algorithm for submodular flow
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)