Bipartite graphs are naturally used to model relationships between two different types of
entities, such as people-location, authorpaper, and customer-product. When modeling real …

We study the historical connectivity query in temporal graphs where edges continuously
arrive. Given an arbitrary time window, and two query vertices, the problem aims to identify if …

In this paper, for the first time, we introduce the concepts of window-CCs and window-SCCs
on undirected and directed temporal graphs, respectively. We then study the queries of …

Many real-world relationships between entities can be modeled as temporal graphs, where
each edge is associated with a timestamp or a time interval representing its occurrence. K …

IoT applications can be naturally modeled as a graph where the edges represent the
interactions between devices, sensors, and their environment. Thing'in 1 1 https://www …

The enumeration of hop-constrained simple paths is a building block in many graph-based
areas. Due to the enormous search spaces in large-scale graphs, a single machine can …

Connectivity query processing is a fundamental problem in graph processing. Given an
undirected graph and two query vertices, the problem aims to identify whether they are …

Bipartite graphs are naturally used to model relationships between two types of entities,
such as people-location, user-post, and investor-stock. When modeling real-world …

Reachability is a fundamental problem in graph analysis. In applications such as social
networks and collaboration networks, edges are always associated with timestamps. Most …

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 …