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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

11 | 0:00:00 Start 0:00:05 Ford Fulkerson Algorithm 0:01:12 Blocking Flows 0:01:26 Dinitz Algorithm 0:02:02 Dinitz Analysis 0:03…

2014

The Push-Relabel, or Preflow-Push, Maximum-Flow algorithm was originally developed by Andrew V. Goldberg and Robert E. Tarjan in…

2012

Article history: Received 27 March 2012 Received in revised format 31 May 2012 Accepted June 8 2012 Available online 9 June 2012…

2011

There are many important applied problems that can be formulated as max flow/min cut where the arc capacities depend on a scalar…

2010

We parallelized Goldberg’s push-relabel max flow algorithm and its global update heuristic. We achieve a speedup of 2 for the…

2007

We provide a new probability flow analysis algorithm to automatically identify subgoals in a problem space. Our flow analysis…

2006

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

Object extraction is a core component of computer vision with application to segmentation, tracking, etc. In this paper we…

2004

We present an approach for fault detection in layered interconnection networks (LINs). An LIN is a generalized multistage…

2003

We discuss the application of polynomial combinatorial optimization algorithms to extract the universal zero-temperature…