Skip to main content
SpringerLink
Log in

Numerical investigations on the maximal flow algorithm of Karzanov

Numerische Untersuchungen zum maximalen Fluß-Algorithmus von Karzanov

  • Published:
Computing Aims and scope Submit manuscript

Abstract

An implementation of the algorithm of Karzanov for solving the maximal flow problem is described. After a sketch of Karzanov's idea the Karzanov algorithm is numerically compared with labeling methods. A FORTRAN IV program is listed in the appendix.

Zusammenfassung

Es wird eine Implementierung des Algorithmus von Karzanov zur Lösung des maximalen Flußproblems beschrieben. Nach einer Skizzierung dieses Algorithmus wird über numerische Vergleiche mit Markierungsalgorithmen berichtet. Ein FORTRAN IV Programm befindet sich im Anhang.

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

Access this article

Log in via an institution

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. Bayer, G.: Algorithm 324, MAXFLOW. Communications of the A.C.M.11, 117–118 (1968).

    Google Scholar 

  2. Bayer, G.: Remark On Algorithm 324. Communications of the A.C.M.16, 309 (1973).

    Google Scholar 

  3. Dijkstra, E. W.: A Note On Two Problems In Connection With Graphs. Numerische Mathematik1, 269–271 (1959).

    Google Scholar 

  4. Dinic, E. A.: Algorithm For Solution Of A Problem Of Maximal Flow In A Network With Power Estimation. Soviet Math. Dokl.11, 1277–1280 (1970).

    Google Scholar 

  5. Edmonds, J., Karp, M.: Theoretical Improvement In Algorithmic Efficiency For Network Flow Problems. Journal of the A.C.M.19, 218–264 (1972).

    Google Scholar 

  6. Even, S.: The Maximal Flow Algorithm Of Dinic And Karzanov: An Exposition. Working paper (1976).

  7. Ford, L. R., Fulkerson, D. R.: Flows In Networks. Princeton, N. Y.: Princeton University Press 1962.

    Google Scholar 

  8. Karzanov, A. V.: Determining The Maximal Flow In A Network By The Method of Preflow. Soviet Math. Dokl.15, 434–437 (1974).

    Google Scholar 

  9. Kinariwala, B., Rao, A. G.: Flow Switching Approach to The Maximum Flow Problem: I. Journal of the A.C.M.24, 630–645 (1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universität zu Köln, Weyertal 86-90, D-5000, Köln 41, Federal Republic of Germany

    H. Hamacher

Authors
  1. H. Hamacher
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hamacher, H. Numerical investigations on the maximal flow algorithm of Karzanov. Computing 22, 17–29 (1979). https://doi.org/10.1007/BF02246557

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02246557

Keywords

Search

Navigation