Fast and Compact Oracles for Approximate Distances in Planar Graphs

Laurent Flindt Muller, Martin Zachariasen. Fast and Compact Oracles for Approximate Distances in Planar Graphs. In Lars Arge, Michael Hoffmann, Emo Welzl, editors, Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings. Volume 4698 of Lecture Notes in Computer Science, pages 657-668, Springer, 2007. [doi]

@inproceedings{MullerZ07,
  title = {Fast and Compact Oracles for Approximate Distances in Planar Graphs},
  author = {Laurent Flindt Muller and Martin Zachariasen},
  year = {2007},
  doi = {10.1007/978-3-540-75520-3_58},
  url = {http://dx.doi.org/10.1007/978-3-540-75520-3_58},
  tags = {planar graph, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/MullerZ07},
  cites = {0},
  citedby = {0},
  pages = {657-668},
  booktitle = {Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings},
  editor = {Lars Arge and Michael Hoffmann and Emo Welzl},
  volume = {4698},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-75519-7},
}