On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs


The maximal clique enumeration (MCE) problem can be used to find very tightly-coupled collections of objects inside a network or graph of relationships. However, when such networks are based on noisy or uncertain data, the solutions to the MCE problem for several closely related graphs may be necessary to accurately define the collections. Thus, we propose… (More)
DOI: 10.1145/1610555.1610562


6 Figures and Tables