Arko Provo Mukherjee

Mining maximal cliques from an uncertain graph

2015

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 …