Author:
Bardossy María G.,Shier Douglas R.
Reference17 articles.
1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. R.K. Ahuja and J.B. Orlin. Use of representative operation counts in computational testing of algorithms. INFORMS Journal on Computing, 8:318–330, 1996.
3. R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16:87–90, 1958.
4. D.P. Bertsekas. A simple and fast label correcting algorithm for shortest paths. Networks, 23:703–709, 1993.
5. A. Broder. Generating random spanning trees. 30th Annual Symposium on the Foundations of Computer Science, 442–447, 1989.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献