Distributed Maximal Clique Computation and Management
IEEE Transactions on Services Computing, pp. 110-122, 2016.
Maximal cliques are elementary substructures in a graph and instrumental in graph analysis such as the structural analysis of many complex networks, graph clustering and community detection, network hierarchy detection, emerging pattern mining, vertex importance measures, etc. However, the number of maximal cliques is also notoriously lar...More
Full Text (Upload PDF)
PPT (Upload PPT)