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]

Possibly Related Publications

The following publications are possibly variants of this publication: