Researcher profile

Srikanta Tirthapura

2 papers in the PaperMetrix corpus

Publications

Papers by this author

Mining maximal cliques from an uncertain graph

2015

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 consider the notion of an …
Change-Sensitive Algorithms for Maintaining Maximal Cliques in a Dynamic Graph.

2016 · arXiv (Cornell University)

We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges. We present nearly tight bounds on the magnitude of change …