Enumeration of Maximal Cliques from an Uncertain Graph
Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura · IEEE Transactions on Knowledge and Data Engineering · 2016
We consider the enumeration of dense substructures (maximal cliques) from an uncertain graph. For parameter 0 <; α <; 1, we define the notion of an a-maximal clique in an uncertain graph. We present matching upper and lower bounds on the number of a-maximal cliques possible within a (uncertain) graph. We present an algorithm to enumerate a-maximal cliques whose worst-case runtime is near-optimal, and an experimental evaluation showing the practical utility of the algorithm.