6 citations · 17 across the 7 of their papers we have counts for
7 papers
Enumerating Maximal Bicliques from a Large Graph using MapReduce
Arko Provo Mukherjee, Srikanta Tirthapura
We consider the enumeration of maximal bipartite cliques (bicliques) from a large graph, a task central to many practical data mining problems in social network analysis and bioinf…
Identifying Correlated Heavy-Hitters in a Two-Dimensional Data Stream
Bibudh Lahiri, Arko Provo Mukherjee, Srikanta Tirthapura
We consider online mining of correlated heavy-hitters from a data stream. Given a stream of two-dimensional data, a correlated aggregate query first extracts a substream by applyin…
Mining Maximal Cliques from an Uncertain Graph
Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura
We consider mining dense substructures (maximal cliques) from an uncertain graph, which is a probability distribution on a set of deterministic graphs. For parameter 0 < α < 1, we…
Parallel Triangle Counting in Massive Streaming Graphs
Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura
The number of triangles in a graph is a fundamental metric, used in social network analysis, link classification and recommendation, and more. Driven by these applications and the…
Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification
Albert Angel, Nick Koudas, Nikos Sarkas +1
Recent years have witnessed an unprecedented proliferation of social media. People around the globe author, every day, millions of blog posts, social network status updates, etc. T…
A novel graph-based formulation for characterizing morphology with application to organic solar cells
Olga Wodo, Srikanta Tirthapura, Sumit Chaudhary +1
Organic solar cells have the potential for widespread usage due to their promise of low cost, roll-to-roll manufacturability, and mechanical flexibility. However, deployment is imp…