Author:
Ramesh Varun,Nagarajan Shivanee,Mukherjee Saswati
Publisher
Springer International Publishing
Reference30 articles.
1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications (1993)
2. Badics, T., Boros, E.: Implementing a maximum flow algorithm: experiments with dynamic trees. Netw. Flows Matching First DIMACS Implement. Chall. 12, 43 (1993)
3. Barnett, R.L., Sean Bovey, D., Atwell, R.J., Anderson, L.B.: Application of the maximum flow problem to sensor placement on urban road networks for homeland security. Homel. Secur. Aff. 3(3), 1–15 (2007)
4. Cheriyan, J., Maheshwari, S.N.: Analysis of preflow push algorithms for maximum network flow. SIAM J. Comput. 18(6), 1057–1086 (1989)
5. Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica 19(4), 390–410 (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献