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 …

A shortest-path algorithm finds a path containing the minimal cost between two vertices in a
graph. A plethora of shortest-path algorithms is studied in the literature that span across …

Graph pattern matching is commonly used in a variety of emerging applications such as
social network analysis. These applications highlight the need for studying the following two …

Although there exist efficient methods to determine an optimal path in a graph, such as
Dijkstra and A* algorithms, large instances of the path planning problem need more …

We propose graph encryption schemes that efficiently support approximate shortest distance
queries on large-scale encrypted graphs. Shortest distance queries are one of the most …

As network research becomes more sophisticated, it is more common than ever for
researchers to find themselves not studying a single network but needing to analyze sets of …

Computing shortest paths between two given nodes is a fundamental operation over graphs,
but known to be nontrivial over large disk-resident instances of graph data. While a number …

Increasingly, location-aware datasets are of a size, variety, and update rate that exceeds the
capability of spatial computing technologies. This paper addresses the emerging challenges …

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 …