Author:
Babenko Maxim A.,Karzanov Alexander V.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Lecture Notes in Computer Science;M.A. Babenko,2007
2. Cherkassky, B.V.: A solution of a problem on multicommodity flows in a network. Ekonomika i Matematicheskie Metody 13(1), 143–151 (1977)
3. Ford, L., Fulkerson, D.: Flows in Networds. Princeton University Press, Princeton (1962)
4. Frank, A.: On connectivity properties of Eulerian digraphs. Ann. Discrete Math. 41, 179–194 (1989)
5. Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45(5), 783–797 (1998)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献