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, ...
share
research
∙
12/08/2018
Counting Butterfies from a Large Bipartite Graph Stream
We consider the estimation of properties on massive bipartite graph stre...
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
∙
12/31/2017
