The world is becoming a more conjunct place and the number of data sources such as
social networks, online transactions, web search engines, and mobile devices is increasing …

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 …

Graph mining workloads aim to extract structural properties of a graph by exploring its
subgraph structures. General purpose graph mining systems provide a generic runtime to …

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 …

There is growing interest in graph pattern mining (GPM) problems such as motif counting.
GPM systems have been developed to provide unified interfaces for programming …

This paper studies the problem of MCC-Sparse, Maximum Clique Computation over large
real-world graphs that are usually Sparse. In the literature, MCC-Sparse has been studied …

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 …

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

Subgraph enumeration is a fundamental problem in graph analytics, which aims to find all
instances of a given query graph on a large data graph. In this paper, we propose a system …