Distributed Maximal Clique Computation

BigData Congress, pp. 160-167, 2014.

Cited by: 14|Bibtex|Views60|DOI:https://doi.org/10.1109/BigData.Congress.2014.31
EI WOS
Other Links: dl.acm.org|dblp.uni-trier.de

Abstract:

Maximal cliques are important substructures in graph analysis. Many algorithms for computing maximal cliques have been proposed in the literature, however, most of them are sequential algorithms that cannot scale due to the high complexity of the problem, while existing parallel algorithms for computing maximal cliques are mostly immature...More

Code:

Data:

Your rating :
0

 

Tags
Comments