Skip to main content
Log in

Quick Max-flow Algorithm

  • Published:
Journal of Mathematical Modelling and Algorithms

Abstract

Determining of a maximal network flow is a classic problem in discrete optimization with many applications. In this paper, a new algorithm based on the Dinic’s method is presented. Algorithms of the Dinic’s method work evidently faster than theoretical bounds for a randomized network. This paper presents a parameterized and easy to implement family of algorithms of finding a saturating flow in a layered network. Although their common complexity is poor O(V 2 L) where L is the number of layers, three particular members are proved to be O(V 2). Furthermore, there is a particularly interesting “balanced” member of the family for which a calculated upper bound on complexity is still O(V 2 L) but there is known no example of a layered network that needs more than O(E + V (3/2)) time to resolve. All the considered members work really quickly for randomized examples of a layered network. Starting from the above family, three algorithms which find maximal flow in a network in O(V 3) worst case time have been constructed, while the respective “balanced” algorithm is theoretically O(V 4). All the algorithms do not extend O(V 2) time in experimental, i.e. randomized, cases.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)

    MATH  MathSciNet  Google Scholar 

  2. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)

    MATH  Google Scholar 

  3. Dinic, E.A.: Algorithm for solution of a problem of maximal flow in a network with power estimation. Sov. Math. Dokl. 11, 1277–1280 (1970)

    Google Scholar 

  4. Edmonds, J., Karp, R.M.: Theoretical improvement in algorithmic efficienty for network flow problems. J. Assoc. Comput. Mach. 19, 248–264 (1972)

    MATH  Google Scholar 

  5. Karzanow, A.V.: Determining the maximal flow in a network by the method of pre-flows. Sov. Math. Dokl. 15, 434–437 (1974)

    Google Scholar 

  6. Malhotra, V.M., Pramodh Kumar, M., Maheshwari, S.N.: An O(|V|3) algorithm for finding the maximum flows in network. Inf. Process. Lett. 7, 277–278 (1978)

    Article  MATH  Google Scholar 

  7. Goldberg, A.V.: Efficient graph algorithms for sequential and parallel computers. PhD thesis, Department of Electrical Engineering and Computer Science, MIT (1987)

  8. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT, Cambridge (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Przemysław Gordinowicz.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gordinowicz, P. Quick Max-flow Algorithm. J Math Model Algor 8, 19–34 (2009). https://doi.org/10.1007/s10852-008-9091-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-008-9091-z

Keywords

Mathematics Subject Classifications (2000)

Navigation