aktuelle Version des Vorlesungsskripts - ZIB

Literaturverzeichnis
L. R. Ford, Jr. and D. R. Fulkerson. Maximal flow through a network. Canadian Journal
of Mathematics, 8:399–404, 1956.
A. Frank. Connectivity and network flows. In R. L. Graham et al., editors, Handbook of
Combinatorics, chapter 2, pages 111–177. North-Holland, Amsterdam, 1995.
J. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press,
Princeton, 1962.
A. F. P. Elias and C. E. Shannon. Note on maximum flow through a network. IRE
Trans. on Inform. Theory, (2):117–119, 1956.
A. Schrijver. Combinatorial Optimization – Polyhedra and Efficiency. Springer-Verlag,
Berlin, 2003.
E. T. V. Goldberg and R. E. Tarjan. Network flow algorithms. In in B. Korte et al.
(eds.), editor, Paths, Flows, and VLSI-Layout. Springer-Verlag, Berlin, 1990.
128