Author:
Meyer Ulrich,Sanders Peter
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. P. Adamson and E. Tick. Greedy partitioned algorithms for the shortest path problem. International Journal of Parallel Programming, 20(4):271–298, 1991.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
3. N. Alon, J. H. Spencer, and P. Erdős. The Probabilistic Method. Wiley, 1992.
4. G. S. Brodal, J. L. Träff, and C. D. Zaroliagis. A parallel priority queue with constant time operation. In Proceedings of the 11th International Parallel Processing Symposium, pages 689–693. IEEE, 1997.
5. K. M. Chandy and J. Misra. Distributed computation on graphs: Shortest path algorithms. Communications of the ACM, 25(11):833–837, 1982.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献