Distributed Maximal Clique Computation
BigData Congress, pp. 160-167, 2014.
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
Full Text (Upload PDF)
PPT (Upload PPT)