Recently, the topic of community search (CS) has gained plenty of attention. Given a query
vertex, CS looks for a dense subgraph that contains it. Existing studies mainly focus on …

Numerous studies have been conducted to investigate the properties of large-scale
temporal graphs. Despite the ubiquity of these graphs in real-world scenarios, it's usually …

Graph processing is becoming increasingly prevalent across many application domains. In
spite of this prevalence, there is little research about how graphs are actually used in …

Cohesive subgraph mining in bipartite graphs becomes a popular research topic recently.
An important structure k-bitruss is the maximal cohesive subgraph where each edge is …

In-memory databases (IMDBs) store all working data in the main memory, making memory
access the dominant factor in system performance. Moreover, for modern multi-version …

GraphScope is a system and a set of language extensions that enable a new programming
interface for large-scale distributed graph computing. It generalizes previous graph …

Our aim in this paper is to detect bank clients involved in suspicious activities related to
money laundering, using the graph of transactions of the bank. Although we have a labeled …

Cloud databases have been widely accepted and deployed due to their unique advantages,
such as high elasticity, high availability, and low cost. Many new techniques, such as …

Recently there emerge many distributed algorithms that aim at solving subgraph matching at
scale. Existing algorithm-level comparisons failed to provide a systematic view of distributed …

With the advent of a wide spectrum of recent applications, querying heterogeneous
information networks (HINs) has received a great deal of attention from both academic and …