Ultrafast Shortest-Path Queries via Transit Nodes

H. Bast, Stefan Funke, Domagoj Matijevic. Ultrafast Shortest-Path Queries via Transit Nodes. In Camil Demetrescu, Andrew V. Goldberg, David S. Johnson, editors, The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 13-14, 2006. Volume 74 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 175-192, DIMACS/AMS, 2006.

@inproceedings{BastFM06,
  title = {Ultrafast Shortest-Path Queries via Transit Nodes},
  author = {H. Bast and Stefan Funke and Domagoj Matijevic},
  year = {2006},
  researchr = {https://researchr.org/publication/BastFM06},
  cites = {0},
  citedby = {0},
  pages = {175-192},
  booktitle = {The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 13-14, 2006},
  editor = {Camil Demetrescu and Andrew V. Goldberg and David S. Johnson},
  volume = {74},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  publisher = {DIMACS/AMS},
}