Huge diagrams have unique properties for organizations and research, such as client
linkages in informal organizations and customer evaluation lattices in social channels. They …

Big graphs, such as user interactions in social networks and customer rating matrices in
collaborative filters, possess great values for both businesses and research. They are not …

Constrained shortest distance (CSD) querying is one of the fundamental graph query
primitives, which finds the shortest distance from an origin to a destination in a graph with a …

The constrained shortest distance (CSD) query is used to determine the shortest distance
between two vertices of a graph while ensuring that the total cost remains lower than a given …

When coming to perform shortest distance queries on encrypted graph data outsourced in
external storage infrastructure such as cloud, a significant challenge is how to compute the …

In the era of big data, graph databases have become increasingly important for NoSQL
technologies, and many systems can be modeled as graphs for semantic queries …

Finding min-cut is a fundamental operation in graph theory. It has been widely used in many
applications such as image segmentation and network partition. However, solving the min …

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 …

Graphs are widely used to model the complex relationships among entities. As a powerful
tool for graph analytics, graph neural networks (GNNs) have recently gained wide attention …

Graph encryption schemes (introduced by [Chase and Kamara, 2010]) have been receiving
growing interest across various disciplines due to their attractive tradeoff between …