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 …

With the prevalence of Internet access and online services, various big graphs are
generated in many real applications (eg, online social networks and knowledge graphs). An …

Kineograph is a distributed system that takes a stream of incoming data to construct a
continuously changing graph, which captures the relationships that exist in the data feed. As …

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 …

An online ride-hailing (ORH) service, such as Uber and Didi Chuxing, can provide on-
demand transportation service to users via mobile phones, which brings great convenience …

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 …

In a team formation problem, one is required to find a group of users that can match the
requirements of a collaborative task. Example of such collaborative tasks abound, ranging …

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 …

The most efficient known approach for shortest distance querying on road networks is via a
tree decomposition based 2-hop labeling index. A major challenge here is how to reduce …

We study the problem of computing shortest path or distance between two query vertices in
a graph, which has numerous important applications. Quite a number of indexes have been …