@inproceedings{mukherjee2015mining,
author = {Mukherjee, Arko and Xu, Pan and Tirthapura, Srikanta},
title = {Mining maximal cliques from an uncertain graph},
booktitle = {2015 International Conference on Data Engineering},
year = {2015},
month = {April},
abstract = {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 α-maximal clique in an uncertain graph. We present matching upper and lower bounds on the number of α-maximal cliques possible within a (uncertain) graph. We present an algorithm to enumerate α-maximal cliques whose worst-case runtime is near-optimal, and an experimental evaluation showing the practical utility of the algorithm.},
publisher = {IEEE},
url = {http://approjects.co.za/?big=en-us/research/publication/mining-maximal-cliques-from-an-uncertain-graph/},
pages = {243-254},
}