We study the performance of eight representative in-memory subgraph matching algorithms.
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …

A subgraph query searches for all embeddings in a data graph that are identical to a query
graph. Two kinds of algorithms, either graph exploration based or join based, have been …

Subgraph query processing (also known as subgraph search) and subgraph matching are
fundamental graph problems in many application domains. A lot of efforts have been made …

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 …

Continuous subgraph matching (CSM) is an important building block in many real-time
graph processing applications. Given a subgraph query Q and a data graph stream, a CSM …

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 …

Currently, there is a" boom" in introductory programming courses to help students develop
their computational thinking skills. Providing timely, personalized feedback that makes …

Continuous subgraph matching (CSM) algorithms find the occurrences of a given pattern on
a stream of data graphs online. A number of incremental CSM algorithms have been …

Continuously monitoring structural patterns in streaming graphs is a critical task in many real-
time graph-based applications. In this paper, we study the problem of time-constrained …

Subgraph matching is a fundamental problem in graph theory and has wide applications in
areas like sociology, chemistry, and social networks. Due to its NP-hardness, the basic …