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 …

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 …

This paper proposes Mandheling, the first system that enables highly resource-efficient on-
device training by orchestrating mixed-precision training with on-chip Digital Signal …

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 …

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 …

Graph analytical queries (GAQs) are becoming increasingly important in various domains,
including social networks, recommendation systems, and bioinformatics, among others …

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 …

Subgraph enumeration is a heavy-computing procedure that lies at the core of Graph
Pattern Mining (GPM) algorithms, whose goal is to extract subgraphs from larger graphs …

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 counting is a fundamental component for many downstream applications such as
graph representation learning and query optimization. Since obtaining the exact count is …