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]

@article{MohringSSWW06,
  title = {Partitioning graphs to speedup Dijkstra s algorithm},
  author = {Rolf H. Möhring and Heiko Schilling and Birk Schütz and Dorothea Wagner and Thomas Willhalm},
  year = {2006},
  doi = {10.1145/1187436.1216585},
  url = {http://doi.acm.org/10.1145/1187436.1216585},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/MohringSSWW06},
  cites = {0},
  citedby = {0},
  journal = {ACM Journal of Experimental Algorithmics},
  volume = {11},
}