We present a versatile and scalable algorithm for computing exact distances on real-world
networks with tens of millions of arcs in real time. Unlike existing approaches, preprocessing …

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 …

The distance between vertices is one of the most fundamental measures for representing
relations between them, and it is the basis of other classic measures of vertices, such as …

The emergence of real life graphs with billions of nodes poses significant challenges for
managing and querying these graphs. One of the fundamental queries submitted to graphs …

Answering exact shortest path distance queries is a fundamental task in graph theory.
Despite a tremendous amount of research on the subject, there is still no satisfactory …

The distance query, which asks the length of the shortest path from a vertex u to another
vertex v, has applications ranging from link analysis, semantic web and other ontology …

Shortest-path query processing not only serves as a long established routine for numerous
applications in the past but also is of increasing popularity to support novel graph …

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 …

Computing shortest paths in graphs is one of the most fundamental and well-studied
problems in combinatorial optimization. Numerous real-world applications have stimulated …

We propose an indexing scheme for top-k shortest-path distance queries on graphs, which
is useful in a wide range of important applications such as network-aware search and link …