A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components

@article{Rossi2013AFP,
  title={A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components},
  author={Ryan A. Rossi and David F. Gleich and Assefaw Hadish Gebremedhin and Md. Mostofa Ali Patwary},
  journal={CoRR},
  year={2013},
  volume={abs/1302.6256}
}
We propose a fast, parallel, maximum clique algorithm for large, sparse graphs that is designed to exploit characteristics of social and information networks. We observe roughly linear runtime scaling over graphs between 1000 vertices and 100M vertices. In a test with a 1.8 billion-edge social network, the algorithm finds the largest clique in about 20 minutes. For social networks, in particular, we found that using the core number of a vertex in combination with a good heuristic clique finder… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS
14 Citations
61 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

Similar Papers

Loading similar papers…