A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory–
[chapter]

2013
*
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
*

Distance oracles are data structures that provide fast (possibly approximate) answers to shortest-path and distance queries in graphs. The tradeoff between the space requirements and the query time of distance oracles is of particular interest and the main focus of this paper. Unless stated otherwise, we assume all graphs to be planar and undirected. In FOCS 2001 (J. ACM 2004), Thorup introduced approximate distance oracles for planar graphs (concurrent with Klein, SODA 2002). Thorup proved

doi:10.1137/1.9781611973105.30
dblp:conf/soda/GroheKR13
fatcat:hzy72uuhk5c3vjliv2izydtbqe