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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.