Skip to main content
SpringerLink
Log in

Finding a maximum flow in /s,t/-planar network in linear expected time

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berge,C., Ghouila-Houri,A. Programming, Games and Transportation Networks, Methuen, Agincourt, Ontario.

    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.,Fulkerson, D.R. Maximal flow through a network. Canad.J.Math. 8 /1956/, 399–404.

    Google Scholar 

  4. Ford, L.R.,Fulkerson, D.R. Flows in Networks. Princeton University Press, New Jersey, 1962.

    Google Scholar 

  5. Hassin, R. Maximum flow in /s,t/-planar networks. Info.Proc.Letters, 13,3 /1981/, 107.

    Google Scholar 

  6. Itai, A.,Shiloach, Y. Maximum flow in planar networks. SIAM J.COmput. 8 /1979/,135–150.

    Google Scholar 

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

    Google Scholar 

  8. Knuth, D.E. The Art of Computer Programming. Vol.1.Basic Algorithms. Vol.3.Sorting and Searching. Addison-Wesley, Reading, 1968 and 1973.

    Google Scholar 

  9. Kučera, L. Maximum flow in planar networks. In Mathematical Foundation of Computer Science.Gruska, J. and Chytil, M.eds.,Lecture Notes in Computer Science 118, Springer Verlag, Berlin, 1981, 418–422.

    Google Scholar 

  10. Overmars, M.H. The Design of Dynamic Data Structure, Lecture Notes in Computer Science 158, Springer Verlag, Berlin, 1983.

    Google Scholar 

  11. Sleator,D,D. An O(nm log n) algorithm for maximum network flow. Ph.D.Thesis, Stanford Univ., 1980.

    Google Scholar 

  12. Wiederman, J. Preserving total order in constant expected time. In Mathematical Foundation of Computer Science, Gruska, J. and Chytil, M. eds., Lecture Noters in Computer Science 118, Springer Verlag, Berlin, 1981, 554–562.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Charles University, Prague, Czechoslovakia

    L. Kučera

Authors
  1. L. Kučera
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kučera, L. (1984). Finding a maximum flow in /s,t/-planar network in linear expected time. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030319

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation