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 …

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 …

Abstract When using Location-Based Services (LBS), intelligent route planning becomes
crucial to improve service quality and user experience. The state-of-the-art G-tree structure …

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 …

Arising from structural graph theory, treewidth has become a focus of study in fixed-
parameter tractable algorithms. Many NP-hard problems are known to be solvable in O (n· 2 …

We investigate the complexity of several fundamental polynomial-time solvable problems on
graphs and on matrices, when the given instance has low treewidth; in the case of matrices …

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 …

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 …

We propose two dynamic indexing schemes for shortest-path and distance queries on large
time-evolving graphs, which are useful in a wide range of important applications such as …

Treewidth is a parameter that measures how tree-like a relational instance is, and whether it
can reasonably be decomposed into a tree. Many computation tasks are known to be …