32 citations · 74 across the 12 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2020
Shared-Memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs
Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura
Maximal Clique Enumeration (MCE) is a fundamental graph mining problem, and is useful as a primitive in identifying dense structures in a graph. Due to the high computational cost…
cs.DC2019
Optimal Random Sampling from Distributed Streams Revisited
Srikanta Tirthapura, David P. Woodruff
We give an improved algorithm for drawing a random sample from a large data stream when the input elements are distributed across multiple sites which communicate via a central coo…