32 citations · 74 across the 12 of their papers we have counts for
6 papers · 1 filter
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…
Variance-Optimal Offline and Streaming Stratified Random Sampling
Trong Duc Nguyen, Ming-Hung Shih, Divesh Srivastava +2
Stratified random sampling (SRS) is a fundamental sampling technique that provides accurate estimates for aggregate queries using a small size sample, and has been used widely for…
Onion Curve: A Space Filling Curve with Near-Optimal Clustering
Pan Xu, Cuong Nguyen, Srikanta Tirthapura
Space filling curves (SFCs) are widely used in the design of indexes for spatial and temporal data. Clustering is a key metric for an SFC, that measures how well the curve preserve…
Butterfly Counting in Bipartite Networks
Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyuce, Srikanta Tirthapura
We consider the problem of counting motifs in bipartite affiliation networks, such as author-paper, user-product, and actor-movie relations. We focus on counting the number of occu…