Skip to main content
SpringerLink
Log in
Book cover

Information Technology: New Generations pp 327–337Cite as

Maximum Clique Solver Using Bitsets on GPUs

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 448))

Abstract

Finding the maximum clique in a graph is useful for solving problems in many real world applications. However the problem is classified as NP-hard, thus making it very difficult to solve for large and dense graphs. This paper presents one of the only exact maximum clique solvers that takes advantage of the parallelism of Graphical Processing Units (GPUs). The algorithm makes use of bitsets to reduce the amount of storage space needed and take advantage of bit-level parallelism in hardware to increase performance. The results show that the GPU implementation of the algorithm performs better than the corresponding sequential algorithm in almost all cases; performance gains tend to be more prominent on larger graph sizes that can be solved using more levels of parallelism.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cruz, R., Lopez, N., Trefftz, C.: Parallelizing a heuristic for the maximum clique problem on gpus and clusters of workstations. In: 2013 IEEE International Conference on Electro/Information Technology (EIT), pp. 1–6. IEEE (2013)

    Google Scholar 

  2. Howbert, J.J., Roberts, J.: The maximum clique problem (2007). http://courses.cs.washington.edu/courses/csep521/07wi/prj/jeff_jacki.pdf (accessed: May 9, 2015)

  3. Johnson, D., Trick, M.: Cliques, coloring, and satisfiability, dimacs series in disc. Math. and Theoret. Comput. Sci. 26 (1996)

    Google Scholar 

  4. McCreesh, C., Prosser, P.: Multi-threading a state-of-the-art maximum clique algorithm. Algorithms 6(4), 618–635 (2013)

    Article  MathSciNet  Google Scholar 

  5. NVIDIA Corporation: Cuda c programming guide (2015). http://docs.nvidia.com/cuda/cuda-c-programming-guide/ (accessed: May 9, 2015)

  6. Prosser, P.: Exact algorithms for maximum clique: A computational study. Algorithms 5(4), 545–587 (2012)

    Article  MathSciNet  Google Scholar 

  7. Rossi, R.A., Gleich, D.F., Gebremedhin, A.H., Patwary, M., Ali, M.: Parallel maximum clique algorithms with applications to network analysis and storage. arXiv preprint arXiv:1302.6256 (2013)

  8. Rossi, R.A., Gleich, D.F., Gebremedhin, A.H., Patwary, M.M.A.: A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components. CoRR abs/1302.6256 (2013). http://arxiv.org/abs/1302.6256

  9. San Segundo, P., Matia, F., Rodriguez-Losada, D., Hernando, M.: An improved bit parallel exact maximum clique algorithm. Optimization Letters 7(3), 467–479 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  10. San Segundo, P., Rodriguez-Losada, D.: Robust global feature based data association with a sparse bit optimized maximum clique algorithm. IEEE Transactions on Robotics 29(5), 1332–1339 (2013)

    Article  Google Scholar 

  11. San Segundo, P., Rodríguez-Losada, D., Jiménez, A.: An exact bit-parallel algorithm for the maximum clique problem. Computers & Operations Research 38(2), 571–581 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. San Segundo, P., Rodríguez-Losada, D., Matía, F., Galán, R.: Fast exact feature based data correspondence search with an efficient bit-parallel mcp solver. Applied Intelligence 32(3), 311–329 (2010)

    Article  Google Scholar 

  13. San Segundo, P., Tapia, C.: Relaxed approximate coloring in exact maximum clique search. Computers & Operations Research 44, 185–192 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. Journal of Global Optimization 37(1), 95–111 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Discrete Mathematics and Theoretical Computer Science, pp. 278–289. Springer (2003)

    Google Scholar 

  16. Trefftz, C., Santamaria-Galvis, A., Cruz, R.: Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units. In: 2014 IEEE International Conference on Electro/Information Technology (EIT), pp. 100–102. IEEE (2014)

    Google Scholar 

  17. Xiang, J., Guo, C., Aboulnaga, A.: Scalable maximum clique computation using mapreduce. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 74–85. IEEE (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Nevada, Reno, USA

    Matthew VanCompernolle, Lee Barford & Frederick Harris Jr.

  2. Keysight Laboratories, Keysight Technologies, Santa Clara, USA

    Lee Barford

Authors
  1. Matthew VanCompernolle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lee Barford
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Frederick Harris Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frederick Harris Jr. .

Editor information

Editors and Affiliations

  1. PHASE , Las Vegas, Nevada, USA

    Shahram Latifi

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

VanCompernolle, M., Barford, L., Harris, F. (2016). Maximum Clique Solver Using Bitsets on GPUs. In: Latifi, S. (eds) Information Technology: New Generations. Advances in Intelligent Systems and Computing, vol 448. Springer, Cham. https://doi.org/10.1007/978-3-319-32467-8_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-32467-8_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-32466-1

  • Online ISBN: 978-3-319-32467-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation