A fast estimation of shortest path distance for power-law network predominant cloud service
- Jin Liu, Chunming Rong, Gansen Zhao
- 4th IEEE International Conference on Cloud…
- 2012
Highly Influenced
4 Excerpts
Distance Oracles for Sparse Graphs
- Published 2009 in 2009 50th Annual IEEE Symposium on Foundations of…
Abstract
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)
Topics
1 Figure or Table
Statistics
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.