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 …

Shortest path is a fundamental graph problem with numerous applications. However, the
concept of classic shortest path is insufficient or even flawed in a temporal graph, as the …

The rapid growth in the volume of many real-world graphs (eg, social networks, web graphs,
and spatial networks) has led to the development of various vertex-centric distributed graph …

We investigate the gap between theory and practice for exact branching algorithms. In
theory, branch-and-reduce algorithms currently have the best time complexity for numerous …

There is a growing need for distributed graph processing systems that are capable of
gracefully scaling to very large graph datasets. Unfortunately, this challenge has not been …

Graphs in real life applications are often huge, such as the Web graph and various social
networks. These massive graphs are often stored and processed in distributed sites. In this …

Reachability querying is a basic graph operation with numerous important applications in
databases, network analysis, computational biology, software engineering, etc. Although …

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 …

This paper studies the problem of efficiently computing a maximum independent set from a
large graph, a fundamental problem in graph analysis. Due to the hardness results of …

Computing the shortest path for any two given vertices is an important problem in road
networks. Since real road networks are dynamically updated due to real-time traffic …