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 …

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 …

For a temporal graph like transaction network, finding a densely connected subgraph that
contains a vertex like a suspicious account during a period is valuable. Thus, we study the …

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 …

Structural diversity of a vertex refers to the diversity of connections within its neighborhood
and has been applied in various fields such as viral marketing and user engagement. The …

Recently, queries that find bursting patterns in temporal graph data have received
increasing research attention. In particular, finding the flow in temporal networks whose flow …

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 …

A temporal bipartite graph is a graph model that incorporates time-related information into its
edges, making it suitable for modeling real-world phenomena like disease outbreaks …

Bipartite graphs are ubiquitous in many domains, eg, e-commerce platforms, social
networks, and academia, by modeling interactions between distinct entity sets. Within these …

Reachability queries processing has been extensively studied during the past decades.
Many approaches have followed the line of designing 2-hop labels to ensure acceleration …