6 citations · 22 across the 17 of their papers we have counts for
3 papers · 1 filter
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…
A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph
Apurba Das, Srikanta Tirthapura
We consider the maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition or deletion of edges. When the set of edges in a graph ch…