Enumeration of Maximal Cliques from an Uncertain Graph
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 a clique in an uncertain graph. We present matching upper and lower bounds on the number of a-maximal maximal cliques possible within a (uncertain) graph. We present an algorithm to enumerate aa-maximal cliques whose worst-case case runtime is nearnear optimal, and an experimental evaluation showing the p practical ractical utility of the algorithm.