Abstract
Our contribution here is to design efficient distributed algorithms for the maximum flow problem. The idea behind our distributed version of highest-label preflow-push algorithm is to disseminate label values together with safety information from every node. When the algorithm terminates, the computed flow is stored distributedly in incident nodes for all edges, that is, each node knows the values of flow which belong to its adjacent edges. We compute maximum flow in O(n 2 log 3 n) time with communication complexity O(n 2(log3 n + √m)), where n and m are the number of nodes and edges respectively in a network graph.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B.Awerbuch, Boaz Patt-Shamir, D.Peleg, M.Saks: Adapting to Asynchronous Dynamic Networks. 24-th STOC, 1992
B.Awerbuch, T.Leighton: A Simple Local-Control Approximation Algorithm for Multicommodity Flow. 25-th STOC, 1993
B.Awerbuch, T.Leighton: Improved Approximation Algorithms for the Multi Commodity Flow Problem and Local Competitive Routing in Dynamic Networks. 26-th STOC, 1994
B.Awerbuch, D.Peleg: Network Synchronization with Polylogarithmic Overhead. 31-st FOCS, 1990
To-Yat Cheung: Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation. IEEE Trans. on Softw.Eng., 9(4) (1983) 504–512
J.Cheriyan and S.N. Maheshwari. Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM j. Comput., 18:1057–1086, 1989
E.A.Dinic. Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation. Soviet. Math. Dokl. 11, 1970
A.V. Goldberg. Processor Efficient Implementation of a Maximum Flow Algorithm. Information Processing Let., pg.179–185, 1991
A.V., Goldgberg, R.E., Tarjan. A New Approach to the Maximum Flow Problem. J. ACM, 35:921–940, 1988, also in Proc. 18th ACM Symp. on Theory of Comp., 136–146, 1986.
A.V.Goldberg, R.E.Tarjan. A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network. Information processing Letters 31, 1989
N.Linial, M.Saks. Decomposing Graphs Into Regions of Small Diameter. In Proc. 2nd ACM-SIAM Symp.on Discr.Algorithms, Jan.1991
R.K.Ahuja, J.B. Orlin. A Fast and Simple Algorithm for the Maximum Flow Problem. Sloan Working Paper 1905-87, Sloan School of Management, M.I.T., 1987
Y. Shiloach,” U. Vishkin. An O(n 2 log n) Parallel Max-Flow Algorithm. J. Algorithms, 3: 128–146, 1982
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Motyčková, L. (1995). Maximum flow problem in distributed environment. In: Bartosek, M., Staudek, J., Wiedermann, J. (eds) SOFSEM '95: Theory and Practice of Informatics. SOFSEM 1995. Lecture Notes in Computer Science, vol 1012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60609-2_28
Download citation
DOI: https://doi.org/10.1007/3-540-60609-2_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60609-3
Online ISBN: 978-3-540-48463-9
eBook Packages: Springer Book Archive