Partitioning graphs to speedup Dijkstra s algorithm

Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm. Partitioning graphs to speedup Dijkstra s algorithm. ACM Journal of Experimental Algorithmics, 11, 2006. [doi]

Authors

Rolf H. Möhring

This author has not been identified. Look up 'Rolf H. Möhring' in Google

Heiko Schilling

This author has not been identified. Look up 'Heiko Schilling' in Google

Birk Schütz

This author has not been identified. Look up 'Birk Schütz' in Google

Dorothea Wagner

This author has not been identified. Look up 'Dorothea Wagner' in Google

Thomas Willhalm

This author has not been identified. Look up 'Thomas Willhalm' in Google