Maximal Clique Enumeration (MCE) is a fundamental graph mining problem, ...
We consider the estimation of properties on massive bipartite graph stre...
Quasi-cliques are dense incomplete subgraphs of a graph that generalize ...
We present shared-memory parallel methods for Maximal Clique Enumeration...
Graph motifs are used to analyze networks from diverse domains. We consi...