A distributed preflow-push for the maximum flow problem

Authors:
Thuy Lien Pham;Marc Bui;Ivan Lavallee;Si Hoang Do
Affiliations:
Laboratoire de Recherche en Informatique Avancée, Université Paris 8, France;Laboratoire de Recherche en Informatique Avancée, Université Paris 8, France;Laboratoire de Recherche en Informatique Avancée, Université Paris 8, France;Laboratoire de Recherche en Informatique Avancée, Université Paris 8, France
Venue:
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
Year:
2005

Citing 9
Cited 0

Scaling algorithms for network problems

Journal of Computer and System Sciences
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
On the parallel implementation of Goldberg's maximum flow algorithm

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
An introduction to distributed algorithms

An introduction to distributed algorithms
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
An analysis of the highest-level selection rule in the preflow-push max-flow algorithm

Information Processing Letters
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Network information flow

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm that solves the problem of distributively determining the maximum flow in an asynchronous network. This distributed algorithm is based on the preflow-push technique. Sequential processes, executing the same code over local data, exchange messages with neighbors to establish the max flow. This algorithm is derived to the case of multiple sources and/or sinks without modifications. For a network of n nodes and m arcs, the algorithm achieves O(n2m) message complexity and O(n2) time complexity.