论文信息 - A parallel shortest path algorithm

A parallel shortest path algorithm

A new algorithm to find the shortest path between a pair of nodes is presented. In one hand this algorithm expands the search from origin and destination simultaneously, on the other hand it uses a lower bound for the shortest path to guide this search. Computational comparisons with existing algorithms show its efficiency. The implementation on a parallel computer is also discussed.ZusammenfassungWir entwickeln einen neuen Algorithmus, um den kürzesten Weg zwischen einem Paar Knoten zu finden. Einerseits sucht er gleichzeitig ab Start und Ziel und andererseits benutzt er eine untere Grenze der kürzesten Wege, um die Suche zu führen. Vergleiche mit andere Algorithmen zeigen seine Leistung. Wir beschreiben auch die Implementierung auf einen parallelen Computer.

C. Pasche | Th. Mohr

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

[2] T. A. J. Nicholson,et al. Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..

[3] J. Bovet. An improvement on Dijkstra's method for finding the shortest path in a network , 1986 .

[4] Jean Bovet. Une amelioration de la methode de Dijkstra pour la recherche d'un plus court chemin dans un reseau , 1986, Discret. Appl. Math..

[5] Narsingh Deo,et al. Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

[6] Giorgio Gallo,et al. Shortest path algorithms , 1988, Handbook of Optimization in Telecommunications.

[7] Josef Stoer,et al. Numerische Mathematik 1 , 1989 .

[8] G. Gallo,et al. SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .

[9] Robert B. Dial,et al. Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.