A Parallelization of Dijkstra's Shortest Path Algorithm.

Andreas Crauser Kurt Mehlhorn Ulrich Meyer Peter Sanders A Parallelization of Dijkstra's Shortest Path Algorithm. 722-731 1998 conf/mfcs/1998 MFCS http://link.springer.de/link/service/series/0558/bibs/1450/14500722.htm db/conf/mfcs/mfcs98.html#CrauserMMS98