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(n 2 m) message complexity and O(n 2 ) time complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldberg, A.V.: Recent Developments in Maximum Flow Algorithms. Technical Report (April 1998)
Goldberg, A.V., Tarjan, R.E.: A New Approach to the Maximum Flow Problem. Journal of ACM 35(4), 921–940 (1988)
Gabow, H.N.: Scaling Algorithms for Network Problems. Journal of Computer and System Sciences 31(2), 148–168 (1985)
Goldberg, A.V., Rao, S.: Beyond the Flow Decomposition Barrier. Journal of ACM 45(5), 783–797 (1998)
Ford, L.R., Fulkerson, D.R.: Flows in networks. Princeton University Press, Princeton (1962)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows – Theory, Algorithms and Applications. Prentice-Hall, Inc., USA (1993)
Edmonds, J., Karp, R.M.: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of ACM 19(2), 248–264 (1972)
Dinic: Algorithm for Solution of a Problem in Networks with Power Estimation. Journal of ACM 19, 248–264 (1972)
Karzanov: Determining the Maximum Flow in a Network by the Method of Preflows. Soviet Mathematics Doklady 15, 434–437 (1974)
Cheriyan, J., Mehlhorn, K.: An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. Information Processing Letters 69, 239–242 (1999)
Cherkassky, B.V., Goldberg, A.V.: On Implementing Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19, 390–410 (1997)
Anderson, R.J., Setubal, J.C.: On the Parallel Implementation of Goldberg’s Maximum Flow Algorithm. In: Proc. of the 4th Annual ACM Symp. on Parallel Algorithms and Architectures, pp. 168–177 (1992)
Barbosa, V.C.: An introduction to distributed algorithms, ch. 7, pp. 200–216. The MIT Press, Cambridge (1996)
Takkula, T.: A preflow-push algorithm that handles online max flow problems in a static asynchronous network (Revision 1.18). Chalmers University of Technology, Gothenbourg, Sweden (2001)
Nagy, N., Akl, S.G.: The Maximum Flow Problem: A Real-Time Approach. Technical Report, Dept. of Computing and Information Sciences Queen’s Univ., Canada (2001)
Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Trans. on Information Theory 46, 1204–1216 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pham, T.L., Bui, M., Lavallee, I., Do, S.H. (2006). A Distributed Preflow-Push for the Maximum Flow Problem. In: Bui, A., Bui, M., Böhme, T., Unger, H. (eds) Innovative Internet Community Systems. IICS 2005. Lecture Notes in Computer Science, vol 3908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11749776_17
Download citation
DOI: https://doi.org/10.1007/11749776_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33973-1
Online ISBN: 978-3-540-33974-8
eBook Packages: Computer ScienceComputer Science (R0)