Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1981: Mathematical Foundations of Computer Science 1981 pp 389–397Cite as

The maximum k-flow in a network

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 118))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adámek, J. and Koubek, V., Remarks on flows in network with short paths. CMUC 12, 4(1971), 661–667.

    Google Scholar 

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

    Google Scholar 

  3. Ford, L.R. and Fulkerson, D.R., Flows in networks. Princeton University, New Jersey, 1962.

    Google Scholar 

  4. Galil, Z., A new algorithm for the maximal flow problem. Proc.19th IEEE Symp. on Found. Comp. Sci., Ann-Arbor, Mich., October 1978, 231–245.

    Google Scholar 

  5. Galil, Z. and Naamad, A., Network flow and generalized path compression. Proc. 11th ACM Symp. on Theory of Comp., 1979, 13–26.

    Google Scholar 

  6. Karzanov, A.V., Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl. 15(1974), 434–437.

    Google Scholar 

  7. Lovász, L., Neumann-Lara, V. and Plummer, M., Mengerian theorems for paths of bounded length. Perlodica Math. Hungarica, Vol.9(4), 1978, 269–276.

    Google Scholar 

  8. Tarjan, R.E., Recent developments in the complexity of combinatorial algorithms. Proc. 5th IBM Symp. on MFCS, IBM Japan, 1980, 1–28.

    Google Scholar 

  9. Adelson-Velskij, G.M., Dinic, E.A. and Karzanov, A.V., Potokovyje algoritmy/in Russian/.Nauka, Moskva, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computational Centre, Charles University, Malostranské nám. 25, 118 00, Praha 1, Czechoslovakia

    Václav Koubek & Antonín Říha

Authors
  1. Václav Koubek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonín Říha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koubek, V., Říha, A. (1981). The maximum k-flow in a network. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_106

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_106

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

  • Online ISBN: 978-3-540-38769-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation