Preview
Unable to display preview. Download preview PDF.
References
Adámek, J. and Koubek, V., Remarks on flows in network with short paths. CMUC 12, 4(1971), 661–667.
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.
Ford, L.R. and Fulkerson, D.R., Flows in networks. Princeton University, New Jersey, 1962.
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.
Galil, Z. and Naamad, A., Network flow and generalized path compression. Proc. 11th ACM Symp. on Theory of Comp., 1979, 13–26.
Karzanov, A.V., Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl. 15(1974), 434–437.
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.
Tarjan, R.E., Recent developments in the complexity of combinatorial algorithms. Proc. 5th IBM Symp. on MFCS, IBM Japan, 1980, 1–28.
Adelson-Velskij, G.M., Dinic, E.A. and Karzanov, A.V., Potokovyje algoritmy/in Russian/.Nauka, Moskva, 1975.
Author information
Authors and Affiliations
Editor information
Rights 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