Distributed Maximal Clique Computation and Management

IEEE Transactions on Services Computing, pp. 110-122, 2016.

Cited by: 16|Bibtex|Views65|DOI:https://doi.org/10.1109/TSC.2015.2479225
EI WOS
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments