@article{xu2017enumeration,
author = {Xu, Pan and Mukherjee, Arko and Tirthapura, Srikanta},
title = {Enumeration of Maximal Cliques from an Uncertain Graph},
year = {2017},
month = {February},
abstract = {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.},
url = {http://approjects.co.za/?big=en-us/research/publication/enumeration-of-maximal-cliques-from-an-uncertain-graph/},
pages = {543-555},
journal = {IEEE Transactions on Knowledge and Data Engineering},
volume = {29},
number = {3},
}