Skip to main content

Optimal (s,t)-cuts

Extended abstract

  • Conference paper
  • First Online:
Graphtheoretic Concepts in Computer Science (WG 1980)

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

Included in the following conference series:

  • 149 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hamacher, H.: Algebraische Flußprobleme in regulären Matroiden, Doctoral thesis, Universität zu Köln (1980).

    Google Scholar 

  2. Hamacher, H.: Optimal Cuts, Report 8 — 1980, Mathematisches Institut, Universität zu Köln (1980).

    Google Scholar 

  3. Hamacher,H.: Optimal Cocircuits in Regular Matroids, (in preparation).

    Google Scholar 

  4. Hu, T.C.: Integer Programming and Network Flows, Addison-Wesley, Reading, Mass. (1969).

    Google Scholar 

  5. Picard, J.C.; Queyranne, M.: Selected Applications of Maximum Flows and Minimum Cuts in Networks, Report No. EP-79-R-35, Department de Genie Industriel, Ecole Polytechnique de Montreal (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hartmut Noltemeier

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hamacher, H. (1981). Optimal (s,t)-cuts. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-10291-4_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10291-5

  • Online ISBN: 978-3-540-38435-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics