32 citations · 74 across the 12 of their papers we have counts for
3 papers · 2 filters
FLEET: Butterfly Estimation from a Bipartite Graph Stream
Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyuce +1
We consider space-efficient single-pass estimation of the number of butterflies, a fundamental bipartite graph motif, from a massive bipartite graph stream where each edge represen…
Enumerating Top-k Quasi-Cliques
Seyed-Vahid Sanei-Mehri, Apurba Das, Srikanta Tirthapura
Quasi-cliques are dense incomplete subgraphs of a graph that generalize the notion of cliques. Enumerating quasi-cliques from a graph is a robust way to detect densely connected st…
Shared-Memory Parallel Maximal Clique Enumeration
Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura
We present shared-memory parallel methods for Maximal Clique Enumeration (MCE) from a graph. MCE is a fundamental and well-studied graph analytics task, and is a widely used primit…