论文信息 - The shortest path in parallel

The shortest path in parallel

We reexamine Misra's derivation of Dijkstra's shortest path algorithm and consider parallel algorithms that can be obtained from the derivation. We give conditions under which the algorithms can be executed under a model of computation with weaker assumptions than UNITY.

Beverly A. Sanders

[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2] Michael Allen,et al. Parallel programming: techniques and applications using networked workstations and parallel computers , 1998 .

[3] Jayadev Misra. A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation , 2001, Inf. Process. Lett..

[4] K. Mani Chandy,et al. Parallel program design - a foundation , 1988 .