Author:
Zhu Yuanbo,Xu Mingwei,Wu Qian
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Moy, J.: OSPF version 2, Internet Draft, RFC 2178 (1997)
2. Dijkstra, E.: A note two problems in connection with graphs. Numerical Math 1 (1959)
3. Paige, R., Kruskal, C.: Parallel algorithms for shortest paths problems. In: Proc. 1989 Intl. Conf. on Parallel Processing, pp. 14–19 (1989)
4. Brodal, G.S., Traff, J.L., Zaroliagis, C.D.: A parallel priority queue with constant time operations. Journal of Parallel and Distributed Computing 49(1), 4–21 (1998)
5. Cohen, E.: Efficient parallel shortest-paths in digraphs with a separator decomposition. J. Algorithms 21, 331–357 (1996)