2 search results - page 1 / 1 » Levelwise Mesh Sparsification for Shortest Path Queries |
ISAAC
2010
Springer
13 years 2 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
KDD
2004
ACM
13 years 9 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...