A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem

Authors:
Bala G. Chandran;Dorit S. Hochbaum
Affiliations:
Analytics Operations Engineering, Inc., Boston, Massachusetts 02109;Department of Industrial Engineering and Operations Research, and Walter A. Haas School of Business, University of California, Berkeley, California 94720
Venue:
Operations Research
Year:
2009

Citing 5
Cited 7

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
A data structure for dynamic trees

Journal of Computer and System Sciences
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

Operations Research

An efficient graph cut algorithm for computer vision problems

ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Maximum flows by incremental breadth-first search

ESA'11 Proceedings of the 19th European conference on Algorithms
Solving LP relaxations of large-scale precedence constrained problems

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
A New Algorithm for the Open-Pit Mine Production Scheduling Problem

Operations Research
Simplifications and speedups of the pseudoflow algorithm

Networks
Push-relabel based algorithms for the maximum transversal problem

Computers and Operations Research
Max flows in O(nm) time, or better

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several problem instances from the literature. Our results show that our implementation of the pseudoflow algorithm is faster than the best-known implementation of push-relabel on most of the problem instances within our computational study.