Graph Pattern Mining (GPM) extracts higher-order information in a large graph by searching
for small patterns of interest. GPM applications are computationally expensive, and thus …

Subgraph matching is a basic operation in graph analytics, finding all occurrences of a
query graph Q in a data graph G. A common approach is to first filter out non-candidate …

We present a GPU solution for exact maximal clique enumeration (MCE) that performs a
search tree traversal following the Bron-Kerbosch algorithm. Prior works on parallelizing …

Counting k-cliques in a graph is an important problem in graph analysis with many
applications such as community detection and graph partitioning. Counting k-cliques is …

Subgraph isomorphism is a pattern-matching algorithm widely used in many domains such
as chem-informatics, bioinformatics, databases, and social network analysis. It is …

Due to the inherent hardness of subgraph isomorphism, the performance is often a
bottleneck in various real-world applications. We address this by designing an efficient …

Subgraph enumeration is an important problem in the field of Graph Analytics with
numerous applications. The problem is provably NP-complete and requires sophisticated …

Graph pattern matching is powerful and widely applicable to many application domains.
Despite the recent algorithm advances, matching patterns in large-scale real-world graphs …

Subgraph matching is a fundamental building block in graph analytics. Due to its high time
complexity, GPU-based solutions have been proposed for sub graph matching. Most …

Continuous subgraph matching (CSM) is a key building block in many graph mining
applications. Previous research has primarily focused on CSM algorithms on CPU …