Shortest path counting computes the number of shortest paths between two vertices on a
graph, which can be used in the applications such as social network search and POI (Point …

The increasing importance of graph databases and cloud storage services prompts the
study of private queries on graphs. We propose PathGES, a graph encryption scheme (GES) …

Node ranking in heterogeneous graphs, which quantifies the relative importance of nodes,
can often be improved by incorporating information from relevant paths. Graph database …

Hop-constrained st simple path (HC-st path) enu-meration is a fundamental problem in
graph analysis. Existing solutions for this problem focus on optimizing the processing …

Distance labeling approaches are widely adopted to speed up the shortest-distance query
performance. Due to the explosive growth of data graphs, a single machine can hardly …

Dynamic Graph Neural Networks (DGNNs) have demonstrated exceptional performance at
dynamic-graph analysis tasks. However, the costs exceed those incurred by other learning …

Public transportation plays a vital role in mitigating traffic congestion and reducing carbon
emissions. The Top-k Nearest Neighbor (k NN) search in public transportation networks is a …

In the real world, road networks with weight and label on edges can be applied in several
application domains. The shortest path query with label restrictions has been receiving …

Effective resistance (ER) is a fundamental metric for measuring node similarities in a graph,
and it finds applications in various domains including graph clustering, recommendation …

Computing distances and finding shortest paths in massive real-world networks is a
fundamental algorithmic task in network analysis. There are two main approaches to solving …