Computing shortest paths is a fundamental operation in processing graph data. In many real-
world applications, discovering shortest paths between two vertices empowers us to make …

Shortest path computation is a fundamental operation of many applications in small-world
networks, and shortest path index has been extensively studied to achieve high query …

Many real-world applications operate on dynamic graphs that undergo rapid changes in
their topological structure over time. However, it is challenging to design dynamic algorithms …

Many real-world applications operate on dynamic graphs to perform important tasks. In this
article, we study batch-dynamic algorithms that are capable of updating distance labelling …

Finding the shortest-path distance between an arbitrary pair of vertices is a fundamental
problem in graph theory. A tremendous amount of research has explored this problem, most …

We study point-to-point distance estimation in hypergraphs, where the query is
parameterized by a positive integer s, which defines the required level of overlap for two …

Shortest distance computation is one of the widely researched areas in theoretical computer
science and graph databases. Distance labeling are well-known for improving the …

Shortest path computation is ubiquitous in various applications in road networks and the
index-based algorithms, especially hub labeling, can boost the query performance …

Shortest distance calculation between two locations in road networks is an important
problem and has many applications. This problem has been widely researched for over two …

Distance computation is a bottleneck that limits the performance of many applications based
on knowledge graphs (KGs). One common approach to improving online distance …