# Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm

arXiv: https://arxiv.org/abs/1507.01926 · HTML: https://mlsanity.com/paper/1507.01926/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Jul 2015.

## Built on by (most cited first, 1 of 1)

- [Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision](https://mlsanity.com/paper/2202.00418/) (2022)

## Abstract (arXiv)

Motivated by the observation that FIFO-based push-relabel algorithms are able to outperform highest label-based variants on modern, large maximum flow problem instances, we introduce an efficient implementation of the algorithm that uses coarse-grained parallelism to avoid the problems of existing parallel approaches. We demonstrate good relative and absolute speedups of our algorithm on a set of large graph instances taken from real-world applications. On a modern 40-core machine, our parallel implementation outperforms existing sequential implementations by up to a factor of 12 and other parallel implementations by factors of up to 3.