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 …

Understanding the higher-order interactions within network data is a key objective of
network science. Surveys of metadata triangles (or patterned 3-cycles in metadata-enriched …

Graph analytics has emerged as an important tool in the analysis of large scale data from
diverse application domains such as social networks, cyber security and bioinformatics …

In this paper, we propose a GPU-efficient subgraph isomorphism algorithm using the
Gunrock graph analytic framework, GSM (Gunrock Subgraph Matching), to compute graph …

Existing state-of-the-art CPU graph frameworks take advantage of multiple cores, but not the
SIMD capability within each core. In this work, we retarget an existing GPU graph algorithm …

Counting and finding triangles in graphs is often used in real-world analytics to characterize
cohesiveness and identify communities in graphs. In this paper, we propose the novel …

Graphical processing units (GPUs) have been widely used as a general-purpose processing
unit. More recently, there has been fast growing interest in accelerating graph pattern mining …

Subgraph matching is a basic task in querying graph dataset. It can also be called subgraph
isomorphism search which consists to find all embeddings of a small query graph in a large …