Distance Oracles for Sparse Graphs


Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer k, they showed an efficient algorithm to construct an approximate distance oracle using space O(kn^{1+1/k}) that can answer queries in time O(k) with a distance estimate that is at most 2k-1… (More)
DOI: 10.1109/FOCS.2009.27


1 Figure or Table


Citations per Year

62 Citations

Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics