Author:
Bertsekas Dimitri P.,Eckstein Jonathan
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference48 articles.
1. R.K. Ahuja and J.B. Orlin, “A fast and simple algorithm for the maximum flow problem,”Operations Research (to appear).
2. R.K. Ahuja and J.B. Orlin, private communication, November 1987.
3. R.K. Ahuja, J.B. Orlin and R.E. Tarjan, “Improved time bounds for the maximum flow problem,” Sloan School Working Paper 1966–87, MIT, 1987.
4. Awerbuch, B., “Complexity of network synchronization,”Journal of the ACM 32 (1985) 804–823.
5. D.P. Bertsekas and J. Eckstein, “Distributed asynchronous relaxation methods for linear network flow problems,” Proceedings of International Federation of Automatic Control, Munich, July 1987.
Cited by
68 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献