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. (C) 2001 Elsevier Science B.V. All rights reserved.
parallel algorithms unity program derivation