Author:
Cheriyan Joseph,Hagerup Torben,Mehlhorn Kurt
Reference9 articles.
1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
2. R. K. Ahuja and J. B. Orlin, A Fast and Simple Algorithm for the Maximum Flow Problem, Sloan W.P. No. 1905-87 (revised), MIT, October 1988.
3. R. K. Ahuja, J. B. Orlin and R. E. Tarjan, Improved Time Bounds for the Maximum Flow Problem, SIAM J. Comput. 18 (1989), pp. 939–954.
4. N. Alon, Generating Pseudo-Random Permutations and Maximum Flow Algorithms, manuscript, December 1989.
5. J. Cheriyan and T. Hagerup, A Randomized Maximum-Flow Algorithm, Proceedings, 30th Annual Symposium on Foundations of Computer Science (1989), pp. 118–123.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献