Skip to main content
Springer Nature Link
Log in

Parallel Bounded Search for the Maximum Clique Problem

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Given an undirected graph, the Maximum Clique Problem (MCP) is to find a largest complete subgraph of the graph. MCP is NP-hard and has found many practical applications. In this paper, we propose a parallel Branch-and- Bound (BnB) algorithm to tackle this NP-hard problem, which carries out multiple bounded searches in parallel. Each search has its upper bound and shares a lower bound with the rest of the searches. The potential benefit of the proposed approach is that an active search terminates as soon as the best lower bound found so far reaches or exceeds its upper bound. We describe the implementation of our highly scalable and efficient parallel MCP algorithm, called PBS, which is based on a state-of-the-art sequential MCP algorithm. The proposed algorithm PBS is evaluated on hard DIMACS and BHOSLIB instances. The results show that PBS achieves a near-linear speedup on most DIMACS instances and a super-linear speedup on most BHOSLIB instances. Finally, we give a detailed analysis that explains the good speedups achieved for the tested instances.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Berman P, Pelc A. Distributed probabilistic fault diagnosis for multiprocessor systems. In Proc. the 20th International Symposium of Fault-Tolerant Computing, Jun. 1990, pp.340–346. https://doi.org/10.1109/FTCS.1990.89383.

  2. Strickland D M, Barnes E, Sokol J S. Optimal protein structure alignment using maximum cliques. Operations Research, 2005, 53(3): 389–402. https://doi.org/10.1287/opre.1040.0189.

    Article  MathSciNet  MATH  Google Scholar 

  3. Mascia F, Cilia E, Brunato M, Passerini A. Predicting structural and functional sites in proteins by searching for maximum-weight cliques. In Proc. the 24th AAAI Conference on Artificial Intelligence, July 2010, pp.1274–1279. https://doi.org/10.5555/2898607.2898811.

  4. Etzion T, Ostergard P R J. Greedy and heuristic algorithms for codes and colorings. IEEE Trans. Information Theory, 1998, 44(1): 382–388. https://doi.org/10.1109/18.651069.

    Article  MathSciNet  MATH  Google Scholar 

  5. Boginski V, Butenko S, Pardalos P M. Mining market data: A network approach. Computers & Operations Research, 2006, 33(11): 3171–3184. https://doi.org/10.1016/j.cor.2005.01.027.

    Article  MATH  Google Scholar 

  6. Zhang D, Javed O, Shah M. Video object co-segmentation by regulated maximum weight cliques. In Proc. the 13th European Conference on Computer Vision, Sept. 2014, pp.551–566. https://doi.org/10.1007/978-3-319-10584-0_36.

  7. Balasundaram B, Butenko S, Hicks I V. Clique relaxations in social network analysis: The maximum k-plex problem. Operations Research, 2011, 59(1): 133–142. https://doi.org/10.1287/opre.1100.0851.

    Article  MathSciNet  MATH  Google Scholar 

  8. Battiti R, Protasi M. Reactive local search for the maximum clique problem. Algorithmica, 2001, 29(4): 610–637. https://doi.org/10.1007/s004530010074.

    Article  MathSciNet  MATH  Google Scholar 

  9. Pullan W, Mascia F, Brunato M. Cooperating local search for the maximum clique problem. Journal of Heuristics, 2011, 17(2): 181–199. https://doi.org/10.1007/s10732-010-9131-5.

    Article  Google Scholar 

  10. Wu Q H, Hao J K. An adaptive multistart tabu search approach to solve the maximum clique problem. Journal of Combinatorial Optimization, 2013, 26(1): 86–108. https://doi.org/10.1007/s10878-011-9437-8.

    Article  MathSciNet  MATH  Google Scholar 

  11. Benlic U, Hao J K. Breakout local search for maximum clique problems. Computers & Operations Research, 2013, 40(1): 192–206. https://doi.org/10.1016/j.cor.2012.06.002.

    Article  MathSciNet  MATH  Google Scholar 

  12. Carraghan R, Pardalos P M. An exact algorithm for the maximum clique problem. Operations Research Letters, 1990, 9(6): 375–382. https://doi.org/10.1016/0167-6377(90)90057-C.

    Article  MATH  Google Scholar 

  13. Pardalos P M, Rodgers G P. A branch and bound algorithm for the maximum clique problem. Computers & Operations Research, 1992, 19(5): 363–375. https://doi.org/10.1016/0305-0548(92)90067-F.

    Article  MATH  Google Scholar 

  14. Tomita E, Sutani Y, Higashi T, Takahashi S, Wakatsuki M. A simple and faster branch-and-bound algorithm for finding a maximum clique. In Proc. the 4th International Workshop on WALCOM: Algorithms and Computation, Feb. 2010, pp.191–203. https://doi.org/10.1007/978-3-642-11440-3_18.

  15. Segundo P S, Rodríguez-Losada D, Jiménez A. An exact bit-parallel algorithm for the maximum clique problem. Computers & Operations Research, 2011, 38(2): 571–581. https://doi.org/10.1016/j.cor.2010.07.019.

    Article  MathSciNet  MATH  Google Scholar 

  16. Li C M, Quan Z. An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem. In Proc. the 24th AAAI Conference on Artificial Intelligence, July 2010, pp.128–133. https://doi.org/10.5555/2898607.2898628.

  17. Li C M, Quan Z. Combining graph structure exploitation and propositional reasoning for the maximum clique problem. In Proc. the 22nd IEEE International Conference on Tools with Artificial Intelligence, Oct. 2010, pp.344–351. https://doi.org/10.1109/ICTAI.2010.57.

  18. Li C M, Fang Z W, Xu K. Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem. In Proc. the 25th International Conference on Tools with Artificial Intelligence, Nov. 2013, pp.939–946. https://doi.org/10.1109/ICTAI.2013.143.

  19. McCreesh C, Prosser P. Reducing the branching in a branch and bound algorithm for the maximum clique problem. In Proc. the 20th International Conference on Principles and Practice of Constraint Programming, Sept. 2014, pp.549–563. https://doi.org/10.1007/978-3-319-10428-7_40.

  20. Li C M, Jiang H, Xu R C. Incremental MaxSAT reasoning to reduce branches in a branch-and-bound algorithm for MaxClique. In Proc. the 9th International Conference on Learning and Intelligent Optimization, Jan. 2015, pp.268–274. https://doi.org/10.1007/978-3-319-19084-6_26.

  21. Jiang H, Li C M, Manyà F. Combining efficient preprocessing and incremental MaxSAT reasoning for Max-Clique in large graphs. In Proc. the 22nd European Conference on Artificial Intelligence, Aug. 2016, pp.939–947. https://doi.org/10.3233/978-1-61499-672-9-939.

  22. Li C M, Jiang H, Manyà F. On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Computers & Operations Research, 2017, 84: 1–15. https://doi.org/10.1016/j.cor.2017.02.017.

    Article  MathSciNet  MATH  Google Scholar 

  23. Rebennack S, Reinelt G, Pardalos P M. A tutorial on branch and cut algorithms for the maximum stable set problem. International Trans. Operational Research, 2012, 19(1/2): 161–199. https://doi.org/10.1111/j.1475-3995.2011.00805.x.

    Article  MathSciNet  MATH  Google Scholar 

  24. Wu Q H, Hao J K. A review on algorithms for maximum clique problems. European Journal of Operational Research, 2015, 242(3): 693–709. https://doi.org/10.1016/j.ejor.2014.09.064.

    Article  MathSciNet  MATH  Google Scholar 

  25. Johnson D S, Trick M A. Cliques, coloring, and satisfiability. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1996. https://doi.org/10.1090/dimacs/026.

    Chapter  Google Scholar 

  26. Xu K, Boussemart F, Hemery F, Lecoutre C. Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artificial Intelligence, 2007, 171(8/9): 514–534. https://doi.org/10.1016/j.artint.2007.04.001.

    Article  MathSciNet  MATH  Google Scholar 

  27. Pardalos P M, Rappe J, Resende M G C. An exact parallel algorithm for the maximum clique problem. In High Performance Algorithms and Software in Nonlinear Optimization, Leone R, Murli A, Pardalos P M, Toraldo G (eds.), Springer, 1998, pp.279–300. https://doi.org/10.1007/978-1-4613-3279-4_18.

  28. Rossi R A, Gleich D F, Gebremedhin A H, Patwary M A. Parallel maximum clique algorithms with applications to network analysis and storage. arXiv: 1302.6256, 2013. https://arxiv.org/abs/1302.6256, Sept. 2023.

  29. McCreesh C, Prosser P. Multi-threading a state-of-the-art maximum clique algorithm. Algorithms, 2013, 6(4): 618–635. https://doi.org/10.3390/a6040618.

    Article  MathSciNet  MATH  Google Scholar 

  30. McCreesh C, Prosser P. The shape of the search tree for the maximum clique problem and the implications for parallel branch and bound. ACM Trans. Parallel Computing, 2015, 2(1): Article No. 8. https://doi.org/10.1145/2742359.

  31. Rossi R A, Gleich D F, Gebremedhin A H, Patwary M A. A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components. arXiv: 1302. 6256, 2013. http://arxiv.org/abs/1302.6256v1, Sept. 2023.

  32. Segundo P S, Lopez A, Artieda J, Pardalos P M. A parallel maximum clique algorithm for large and massive sparse graphs. Optimization Letters, 2017, 11(2): 343–358. https://doi.org/10.1007/s11590-016-1019-3.

    Article  MathSciNet  MATH  Google Scholar 

  33. Östergård P R J. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 2002, 120 (1/2/3): 197–207. https://doi.org/10.1016/S0166-218X(01)00290-6.

    Article  MathSciNet  MATH  Google Scholar 

  34. Tomita E, Kameda T. An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. Journal of Global Optimization, 2007, 37(1): 95–111. https://doi.org/10.1007/s10898-006-9039-7.

    Article  MathSciNet  MATH  Google Scholar 

  35. Segundo P S, Lopez A, Batsyn M. Initial sorting of vertices in the maximum clique problem reviewed. In Proc. the 8th International Conference on Learning and Intelligent Optimization, Feb. 2014, pp.111–120. https://doi.org/10.1007/978-3-319-09584-4_12.

  36. Li C M, Fang Z W, Jiang H, Xu K. Incremental upper bound for the maximum clique problem. INFORMS Journal on Computing, 2018, 30(1): 137–153. https://doi.org/10.1287/ijoc.2017.0770.

    Article  MathSciNet  MATH  Google Scholar 

  37. Jurkowiak B, Li C M, Utard G. A parallelization scheme based on work stealing for a class of sat solvers. Journal of Automated Reasoning, 2005, 34(1): 73–101. https://doi.org/10.1007/s10817-005-1970-7.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Engineering Research Center of Cyberspace, Yunnan University, Kunming, 650500, China

    Hua Jiang

  2. School of Software, Yunnan University, Kunming, 650500, China

    Hua Jiang, Ke Bai & Hai-Jiao Liu

  3. Laboratory of Modeling, Information and Systems, University of Picardie Jules Verne, 80039, Amiens, France

    Chu-Min Li

  4. Artificial Intelligence Research Institute, Spanish National Research Council, 08193, Catalonia, Spain

    Felip Manyà

  5. Shenzhen Institute of Artificial Intelligence and Robotics for Society, Shenzhen, 518000, China

    Zhang-Hua Fu

  6. Institute of Robotics and Intelligent Manufacturing, Chinese University of Hong Kong, Shenzhen, 518000, China

    Zhang-Hua Fu

Authors
  1. Hua Jiang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Ke Bai
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Hai-Jiao Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Chu-Min Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Felip Manyà
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. Zhang-Hua Fu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Hua Jiang.

Supplementary Information

ESM 1

(PDF 147 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, H., Bai, K., Liu, HJ. et al. Parallel Bounded Search for the Maximum Clique Problem. J. Comput. Sci. Technol. 38, 1187–1202 (2023). https://doi.org/10.1007/s11390-022-1803-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-022-1803-8

Keywords