Shortest-path queries in static networks
We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
We propose a new exact method for shortest-path distance queries on large-scale networks.
Our method precomputes distance labels for vertices by performing a breadth-first search …
Our method precomputes distance labels for vertices by performing a breadth-first search …
Graph query processing using plurality of engines
Zou, LL Chen, MT Özsu, D. Zhao, Answering pattern match queries in large graph
databases via graph embedding. The VLDB Journal, Feb. 2012, pp. 97-120, vol. 21, No. 1 …
databases via graph embedding. The VLDB Journal, Feb. 2012, pp. 97-120, vol. 21, No. 1 …
When hierarchy meets 2-hop-labeling: Efficient shortest distance queries on road networks
Computing the shortest distance between two vertices is a fundamental problem in road
networks. Since a direct search using the Dijkstra's algorithm results in a large search space …
networks. Since a direct search using the Dijkstra's algorithm results in a large search space …
Customizable contraction hierarchies
We consider the problem of quickly computing shortest paths in weighted graphs. Often, this
is achieved in two phases:(1) derive auxiliary data in an expensive preprocessing phase …
is achieved in two phases:(1) derive auxiliary data in an expensive preprocessing phase …
Dynamic hub labeling for road networks
Shortest path finding is the building block of various applications in road networks and the
index-based algorithms, especially hub labeling, can boost the query performance …
index-based algorithms, especially hub labeling, can boost the query performance …
An experimental study on hub labeling based shortest path algorithms
Shortest path distance retrieval is a core component in many important applications. For a
decade, hub labeling (HL) techniques have been considered as a practical solution with fast …
decade, hub labeling (HL) techniques have been considered as a practical solution with fast …
Predictive task assignment in spatial crowdsourcing: a data-driven approach
With the rapid development of mobile networks and the widespread usage of mobile
devices, spatial crowdsourcing, which refers to assigning location-based tasks to moving …
devices, spatial crowdsourcing, which refers to assigning location-based tasks to moving …
Distance-constraint reachability computation in uncertain graphs
Driven by the emerging network applications, querying and mining uncertain graphs has
become increasingly important. In this paper, we investigate a fundamental problem …
become increasingly important. In this paper, we investigate a fundamental problem …
Scaling distance labeling on small-world networks
Distance labeling approaches are widely adopted to speed up the online performance of
shortest distance queries. The construction of the distance labeling, however, can be …
shortest distance queries. The construction of the distance labeling, however, can be …