Maximum flow problem in distributed environment

  • Lenka Motyčková
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1012)


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 (log3n + √m)), where n and m are the number of nodes and edges respectively in a network graph.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B.Awerbuch, Boaz Patt-Shamir, D.Peleg, M.Saks: Adapting to Asynchronous Dynamic Networks. 24-th STOC, 1992Google Scholar
  2. 2.
    B.Awerbuch, T.Leighton: A Simple Local-Control Approximation Algorithm for Multicommodity Flow. 25-th STOC, 1993Google Scholar
  3. 3.
    B.Awerbuch, T.Leighton: Improved Approximation Algorithms for the Multi Commodity Flow Problem and Local Competitive Routing in Dynamic Networks. 26-th STOC, 1994Google Scholar
  4. 4.
    B.Awerbuch, D.Peleg: Network Synchronization with Polylogarithmic Overhead. 31-st FOCS, 1990Google Scholar
  5. 5.
    To-Yat Cheung: Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation. IEEE Trans. on Softw.Eng., 9(4) (1983) 504–512Google Scholar
  6. 6.
    J.Cheriyan and S.N. Maheshwari. Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM j. Comput., 18:1057–1086, 1989Google Scholar
  7. 7.
    E.A.Dinic. Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation. Soviet. Math. Dokl. 11, 1970Google Scholar
  8. 8.
    A.V. Goldberg. Processor Efficient Implementation of a Maximum Flow Algorithm. Information Processing Let., pg.179–185, 1991Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    A.V.Goldberg, R.E.Tarjan. A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network. Information processing Letters 31, 1989Google Scholar
  11. 11.
    N.Linial, M.Saks. Decomposing Graphs Into Regions of Small Diameter. In Proc. 2nd ACM-SIAM Symp.on Discr.Algorithms, Jan.1991Google Scholar
  12. 12.
    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., 1987Google Scholar
  13. 13.
    Y. Shiloach,” U. Vishkin. An O(n 2 log n) Parallel Max-Flow Algorithm. J. Algorithms, 3: 128–146, 1982Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Lenka Motyčková
    • 1
  1. 1.Department of Computer ScienceMasaryk UniversityBrnoCzech Republic

Personalised recommendations