Author:
Ambainis Andris,Špalek Robert
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399–404 (1956)
2. Karzanov, A.V.: Determining the maximal flow in a network by the method of preflows. Soviet Mathematics Doklady 15, 434–437 (1974)
3. Malhotra, V.M., Kumar, P., Maheshwari, S.N.: An O(V
3) algorithm for finding the maximum flows in networks. Information Processing Letters 7, 277–278 (1978)
4. Galil, Z., Naamad, A.: Network flow and generalized path compression. In: Proc. of 11th ACM STOC, pp. 13–26 (1979)
5. Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. Journal of the ACM 45, 783–797 (1998)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献