1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows, volume 1: Optimization of Handbooks in Operations Research and Management Science, chapter IV, pages 211–369. North-Holland, Amsterdam, 1989.
2. S. G. Akl. The Design and Analysis of Parallel Algorithms. Prentice-Hall, 1989.
3. T. Archibald. Parallel dynamic programming. In L. Kronsjo and D. Shumsheruddin, editors, Advances in Parallel Algorithms, AdvancedTopics in Computer Science Series, chapter 11, pages 343–367. Blackwell Scientific Publications, 1992.
4. E. Balas, D. Miller, J. Pekny, and P. Toth. A parallel shortest path algorithm for the assignment problem. Report MSSR 552, Department of Management Science, Carnegie-Mellon University, 1989.
5. E. Balas, D. Miller, J. Pekny, and P. Toth. A parallel shortest path algorithm for the assignment problem. J. Assoc. Comput. Mach 38: 985–1004, 1991.