research
∙
08/28/2023
Efficient Batch Dynamic Graphlet Counting
Graphlet counting is an important problem as it has numerous application...
share
research
∙
01/30/2020
Shared-Memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs
Maximal Clique Enumeration (MCE) is a fundamental graph mining problem, ...
research
∙
08/28/2018
Enumerating Top-k Quasi-Cliques
Quasi-cliques are dense incomplete subgraphs of a graph that generalize ...
research
∙
07/25/2018
Shared-Memory Parallel Maximal Clique Enumeration
We present shared-memory parallel methods for Maximal Clique Enumeration...
research
∙
07/26/2017