Distributed processing of large-scale graph data has many practical applications and has
been widely studied. In recent years, a lot of distributed graph processing frameworks and …

Subgraph counting is a fundamental graph analysis task which has been widely used in
many applications. As the problem of subgraph counting is NP-complete and hence …

Subgraph matching is to find all subgraphs in a data graph that are isomorphic to an existing
query graph. Subgraph matching is an NP-hard problem, yet has found its applications in …

Subgraph matching is a fundamental problem in various fields that use graph structured
data. Subgraph matching algorithms enumerate all isomorphic embeddings of a query …

Interactive GPM (iGPM) is becoming increasingly important, where a series of graph pattern
matching (GPM) queries are created and submitted in an interactive manner based on the …

Subgraph matching is a fundamental problem in graph analysis. In recent years, many
subgraph matching algorithms have been proposed, making it pressing and challenging to …

Subgraph matching is one of the most important problems in graph analytics. Many
algorithms and systems have been proposed for subgraph matching. Most of these works …

Graph is a ubiquitous structure representing entities and their relationships applied in many
areas such as social networks, web graphs, and biological networks. One of the …

Community search is a problem that seeks cohesive and connected subgraphs in a graph
that satisfy certain topology constraints, eg, degree constraints. The majority of existing …

Graph Pattern Mining (GPM) is a class of algorithms that identifies given shapes within a
graph, eg, cliques of a certain size. Any area of a graph can contain a shape of interest, but …