Skip to main content
SpringerLink
Log in

Einige Bemerkungen zu algorithmischen Verbesserungen für den Preflow-Push-Ansatz zur Bestimmung maximaler Flüsse

  • Conference paper
Operations Research Proceedings 1991

Part of the book series: Operations Research Proceedings 1991 ((ORP,volume 1991))

  • 461 Accesses

Zusammenfassung

Sei G = (V,E) ein gerichteter Graph und c(u,v) ∈ N die Flußkapazität für jede Kante (u,v) ∈ E. In V seien zwei Knoten ausgezeichnet, die Quelle s und die Senke t, s ≠ t, wobei gelte

$$\{u(u,s)\in E\}=\{v(t,v)\in E\}=\phi$$

.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Literaturhinweise

  1. Ahuja, R. K.; Orlin J. B. A Fast and Simple Algorithm for the Maximum Flow Problem. Operations Research 37 (1989), 748–759

    Article  Google Scholar 

  2. Cheriyan, J.; Hagerup, T.; Mehlhorn K. Can a Maximum Flow be Computed in o(nm) Time? erscheint in: Proceedings of the 17th International Colloquium on Automata, Languages and Programming, London (1990).

    Google Scholar 

  3. Derigs, U.; Meier, W. Implementing Goldberg’s Max-Flow-Algorithm — A Computational Investigation. ZOR — Methods and Models of Operations Research 33 (1989), 383–403.

    Article  Google Scholar 

  4. Derigs, U.; Meier, W. An Evaluation of Algorithmic Refinements and Proper Data-Structures for the Preflow- Push-Approach for Maximum Flow. Arbeitsbericht, Universität zu Köln, (1991).

    Google Scholar 

  5. Dinic, E. A. Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation. Soviet Mathematics Doklady, Vol. II, No. 5 (1970), 1277–1280

    Google Scholar 

  6. Ford, L. R.; Fulkerson, D. R. Maximal Flow through a Network. Canadian Journal of Mathematics 8 (1956), 399–404.

    Article  Google Scholar 

  7. Goldberg, A. V.; Tarjan, R. E. A New Approach to the Maximum Flow Problem. Journal of the ACM 35 (1986), 921–904.

    Article  Google Scholar 

  8. Karzanov, A. V. Determining the Maximal Flow in a Network by the Method of Preflows. Soviet Mathematics Doklady 15 (1974), 434–437.

    Google Scholar 

  9. Meier, W. Neue Ansätze zur Bestimmung maximaler Flüsse in Netzwerken. Diplomarbeit, Universität Bayreuth (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität zu Köln, Deutschland

    U. Derigs & W. Meier

Authors
  1. U. Derigs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Meier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Karlsruhe(TH), Kaiserstraße 12, W-7500, Karlsruhe 1, Deutschland

    Wolfgang Gaul

  2. Universität zu Köln, Weyertal 86-90, W-5000, Köln 41, Deutschland

    Achim Bachem

  3. Universität Hohenheim, Schloß Osthof, W-7000, Stuttgart 70, Deutschland

    Walter Habenicht

  4. Universität Rostock, Parkstraße 6, O-2500, Rostock 1, Deutschland

    Walter Runge

  5. Europäisches Studienprogramm für Betriebswirstschaft, Pestalozzistraße 73, W-7410, Reutlingen, Deutschland

    Wolfgang W. Stahl

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Derigs, U., Meier, W. (1992). Einige Bemerkungen zu algorithmischen Verbesserungen für den Preflow-Push-Ansatz zur Bestimmung maximaler Flüsse. In: Gaul, W., Bachem, A., Habenicht, W., Runge, W., Stahl, W.W. (eds) Operations Research Proceedings 1991. Operations Research Proceedings 1991, vol 1991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46773-8_102

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46773-8_102

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55410-3

  • Online ISBN: 978-3-642-46773-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation