Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

  • Bharath Pattabiraman
  • Md. Mostofa Ali Patwary
  • Assefaw H. Gebremedhin
  • Wei-keng Liao
  • Alok Choudhary
Conference paper

DOI: 10.1007/978-3-319-03536-9_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8305)
Cite this paper as:
Pattabiraman B., Patwary M.M.A., Gebremedhin A.H., Liao W., Choudhary A. (2013) Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs. In: Bonato A., Mitzenmacher M., Prałat P. (eds) Algorithms and Models for the Web Graph. WAW 2013. Lecture Notes in Computer Science, vol 8305. Springer, Cham

Abstract

The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, information retrieval and many other areas related to the World Wide Web. There exist several algorithms for the problem with acceptable runtimes for certain classes of graphs, but many of them are infeasible for massive graphs. We present a new exact algorithm that employs novel pruning techniques and is able to quickly find maximum cliques in large sparse graphs. Extensive experiments on different kinds of synthetic and real-world graphs show that our new algorithm can be orders of magnitude faster than existing algorithms. We also present a heuristic that runs orders of magnitude faster than the exact algorithm while providing optimal or near-optimal solutions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Bharath Pattabiraman
    • 1
  • Md. Mostofa Ali Patwary
    • 1
  • Assefaw H. Gebremedhin
    • 2
  • Wei-keng Liao
    • 1
  • Alok Choudhary
    • 1
  1. 1.Northwestern UniversityEvanstonUSA
  2. 2.Purdue UniversityWest LafayetteUSA

Personalised recommendations