Simplifications and speedups of the pseudoflow algorithm

Authors:
Dorit S. Hochbaum;James B. Orlin
Affiliations:
Department of Industrial Engineering and Operations Research, University of California, Berkeley, California;MIT Sloan School of Management, Cambridge, Massachusetts
Venue:
Networks
Year:
2013

Citing 8
Cited 1

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
A faster deterministic maximum flow algorithm

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

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

Operations Research

A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The pseudoflow algorithm for solving the maximum flow and minimum cut problems was devised in Hochbaum (2008). The complexity of the algorithm was shown in (2008) to be O(nm log n). Chandran and Hochbaum, (2009) demonstrated that the pseudoflow algorithm is very efficient in practice, and that the highest label version of the algorithm tends to perform best. Here, we improve the running time of the highest label pseudoflow algorithm to O(n3) using simple data structures and to O(nm log (n2/m)) using the dynamic trees data structure. Both these algorithms use a new form of Depth-First-Search implementation that is likely to be fast in practice as well. In addition, we give a new simpler description of the pseudoflow algorithm by relating it to the simplex algorithm as applied to the maximum preflow problem defined here. The interpretation of the generic pseudoflow algorithm as a simplex-like algorithm for the maximum preflow problem motivates the pseudoflow algorithm and highlights differences between the pseudoflow algorithm and the preflow-push algorithm of Goldberg and Tarjan. © 2012 Wiley Periodicals, Inc. NETWORKS, 2013 © 2013 Wiley Periodicals, Inc.