Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it
impractical for graph pattern matching (GPM) in the context of big data. As a result, relaxed …

Subgraph matching (or subgraph isomorphism) is one of the fundamental problems in graph
analysis. Extensive research has been done to develop practical solutions for subgraph …

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 …

Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …

For large-scale graph analytics on the GPU, the irregularity of data access and control flow,
and the complexity of programming GPUs, have presented two significant challenges to …

Subgraph enumeration is important for many applications such as network motif discovery
and community detection. Recent works utilize graphics processing units (GPUs) to …

Subgraph isomorphism is a well-known NP-hard problem that is widely used in many
applications, such as social network analysis and querying over the knowledge graph. Due …

Subgraph matching is a basic operation widely used in many applications. However, due to
its NP-hardness and the explosive growth of graph data, it is challenging to compute …

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 …

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 …