Skip to main content
SpringerLink
Log in

A novel parallel local search algorithm for the maximum vertex weight clique problem in large graphs

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This study proposes a new parallel local search algorithm (Par-LS) for solving the maximum vertex weight clique problem (MVWCP) in large graphs. Solving the MVWCP in a large graph with millions of edges and vertices is an intractable problem. Parallel local search methods are powerful tools to deal with such problems with their high-performance computation capability. The Par-LS algorithm is developed on a distributed memory environment by using message passing interface libraries and employs a different exploration strategy at each processor. The Par-LS introduces new operators parallel(\(\omega \),1)-swap and parallel(1,2)-swap, for searching the neighboring solutions while improving the current solution through iterations. During our experiments, 172 of 173 benchmark problem instances from the DIMACS, BHOSLIB and Network Data Repository graph libraries are solved optimally with respect to the best/optimal reported results. A new best solution for the largest problem instance of the BHOSLIB benchmark (frb100-40) is discovered. The Par-LS algorithm is reported as one of the best performing algorithms in the literature for the solution of the MVWCP in large graphs.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. http://www.cs.hbg.psu.edu/txn131/clique.html.

  2. http://iridia.ulb.ac.be/.

  3. http://networkrepository.com/.

References

  • Alidaee B, Glover F, Kochenberger G, Wang H (2007) Solving the maximum edge weight clique problem via unconstrained quadratic programming. Eur J Oper Res 181:592–597

    Article  Google Scholar 

  • Balas E, Yu CS (1986) Finding a maximum clique in an arbitrary graph. SIAM J Comput 15:1054–1068

    Article  MathSciNet  Google Scholar 

  • Benlic U, Hao J-K (2013) Breakout local search for maximum clique problems. Comput Oper Res 40:192–206

    Article  MathSciNet  Google Scholar 

  • Cai S, Lin J (2016) Fast solving maximum weight clique problem in massive graphs. In: IJCAI, pp 568–574

  • Cantú-Paz E (1998) A survey of parallel genetic algorithms. Calculateurs paralleles, reseaux et systems repartis 10:141–171

    Google Scholar 

  • Dijkhuizen G, Faigle U (1993) A cutting-plane approach to the edge-weighted maximal clique problem. Eur J Oper Res 69:121–130

    Article  Google Scholar 

  • Dokeroglu T (2015) Hybrid teaching-learning-based optimization algorithms for the quadratic assignment problem. Comput Ind Eng 85:86–101

    Article  Google Scholar 

  • Dokeroglu T, Mengusoglu E (2017) A self-adaptive and stagnation-aware breakout local search algorithm on the grid for the steiner tree problem with revenue, budget and hop constraints. Soft Comput 22:1–19

    Google Scholar 

  • Dokeroglu T, Sevinc E, Cosar A (2019) Artificial bee colony optimization for the quadratic assignment problem. Appl Soft Comput 76:595–606

    Article  Google Scholar 

  • El Baz D, Hifi M, Wu L, Shi X (2016) A parallel ant colony optimization for the maximum-weight clique problem. In: IEEE international parallel and distributed processing symposium workshops, 2016, IEEE, pp 796–800

  • Hansen P, Mladenović N, Brimberg J, Pérez JAM (2010) Variable neighborhood search. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics. Springer, Berlin, pp 61–86

    Chapter  Google Scholar 

  • Jiang H, Li C-M, Manya F (2017) An exact algorithm for the maximum weight clique problem in large graphs. In: AAAI, pp 830–838

  • Jiang H, Li C-M, Liu Y, Manya F (2018) A two-stage maxsat reasoning approach for the maximum weight clique problem. In: AAAI

  • Kiziloz HE, Dokeroglu T (2018) A robust and cooperative parallel tabu search algorithm for the maximum vertex weight clique problem. Comput Ind Eng 118:54–66

    Article  Google Scholar 

  • Kucukyilmaz T, Kiziloz HE (2018) Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem. Comput Ind Eng 125:157–170

    Article  Google Scholar 

  • Kumlander D (2004) A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search. In: Proceedings of 5th international conference on modelling, computation and optimization in information systems and management sciences, Citeseer, pp 202–208

  • Li C-M, Liu Y, Jiang H, Manyà F, Li Y (2018) A new upper bound for the maximum weight clique problem. Eur J Oper Res 270:66–77

    Article  MathSciNet  Google Scholar 

  • Lourenço HR, Martin OC, Stützle T (2010) Iterated local search: framework and applications. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics. Springer, Berlin, pp 363–397

    Chapter  Google Scholar 

  • Ma T, Latecki L J (2012) Maximum weight cliques with mutex constraints for video object segmentation. In: IEEE Conference on computer vision and pattern recognition (CVPR), 2012 IEEE, pp 670–677

  • Mascia F, Cilia E, Brunato M, Passerini A (2010) Predicting structural and functional sites in proteins by searching for maximum-weight cliques. In: AAAI

  • Nogueira B, Pinheiro RG (2018) A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs. Comput Oper Res 90:232–248

    Article  MathSciNet  Google Scholar 

  • Nogueira B, Pinheiro RG, Subramanian A (2017) A hybrid iterated local search heuristic for the maximum weight independent set problem. Optim Lett 12:1–17

    MathSciNet  MATH  Google Scholar 

  • Pullan W (2008) Approximating the maximum vertex/edge weighted clique using local search. J Heuristics 14:117–134

    Article  Google Scholar 

  • Pullan W, Hoos HH (2006) Dynamic local search for the maximum clique problem. J Artif Intell Res 25:159–185

    Article  Google Scholar 

  • Tepper M, Sapiro G (2013) Ants crawling to discover the community structure in networks. In: Iberoamerican congress on pattern recognition. Springer, Berlin, pp 552–559

    Chapter  Google Scholar 

  • Wang Y, Hao J-K, Glover F, Lü Z, Wu Q (2016a) Solving the maximum vertex weight clique problem via binary quadratic programming. J Comb Optim 32:531–549

    Article  MathSciNet  Google Scholar 

  • Wang Y, Cai S, Yin M (2016b) Two efficient local search algorithms for maximum weight clique problem. In: AAAI, pp 805–811

  • Warren JS, Hicks IV (2006) Combinatorial branch-and-bound for the maximum weight independent set problem. Relatório Técnico, Texas A&M University, Citeseer 9:17

  • Wu Q, Hao J-K (2015a) Solving the winner determination problem via a weighted maximum clique heuristic. Exp Syst Appl 42:355–365

    Article  Google Scholar 

  • Wu Q, Hao J-K (2015b) A review on algorithms for maximum clique problems. Eur J Oper Res 242:693–709

    Article  MathSciNet  Google Scholar 

  • Wu Q, Hao J-K (2016) A clique-based exact method for optimal winner determination in combinatorial auctions. Inf Sci 334:103–121

    Article  Google Scholar 

  • Wu Q, Hao J-K, Glover F (2012) Multi-neighborhood tabu search for the maximum weight clique problem. Ann Oper Res 196:611–634

    Article  MathSciNet  Google Scholar 

  • Zheng C, Zhu Q, Sankoff D (2007) Removing noise and ambiguities from comparative maps in rearrangement analysis. IEEE/ACM Trans Comput Biol Bioinf 4:515–522

    Article  Google Scholar 

  • Zhian H, Sabaei M, Javan N T, Tavallaie O (2013) Increasing coding opportunities using maximum-weight clique. In: 5th computer science and electronic engineering conference (CEEC), 2013, IEEE, pp 168–173

  • Zhou Y, Hao J-K, Duval B (2017a) Opposition-based memetic search for the maximum diversity problem. IEEE Trans Evol Comput 21:731–745

    Article  Google Scholar 

  • Zhou Y, Hao J-K, Goëffon A (2017b) Push: a generalized operator for the maximum vertex weight clique problem. Eur J Oper Res 257:41–54

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, TED University, Ankara, Turkey

    Tansel Dokeroglu

  2. Department of Computer Engineering, THK University, Ankara, Turkey

    Ender Sevinc

Authors
  1. Ender Sevinc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tansel Dokeroglu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tansel Dokeroglu.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Human and animals participants

This article does not contain any studies with human participants or animals performed by any of the authors.

Informed consent

There is no individual participant included in the study.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sevinc, E., Dokeroglu, T. A novel parallel local search algorithm for the maximum vertex weight clique problem in large graphs. Soft Comput 24, 3551–3567 (2020). https://doi.org/10.1007/s00500-019-04122-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-04122-z

Keywords

Search

Navigation