Distance Oracles for Sparse Graphs

@article{Sommer2009DistanceOF,
  title={Distance Oracles for Sparse Graphs},
  author={Christian Sommer and Elad Verbin and Wei Yu},
  journal={2009 50th Annual IEEE Symposium on Foundations of Computer Science},
  year={2009},
  pages={703-712}
}

• Christian Sommer, Elad Verbin, Wei Yu
• Published in
  50th Annual IEEE Symposium on Foundations of…
  2009
• DOI:10.1109/FOCS.2009.27

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 times larger than the actual shortest distance (this ratio is called the stretch).They proved that, under a combinatorial conjecture, their… CONTINUE READING

View on IEEE

Save to Library

Create Alert

Cite