IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v13y2022i2p1-22.html
   My bibliography  Save this article

Clique Finder: A Self-Adaptive Simulated Annealing Algorithm for the Maximum Clique Problem

Author

Listed:
  • Sarab Almuhaideb

    (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia)

  • Najwa Altwaijry

    (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia)

  • Shahad AlMansour

    (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia)

  • Ashwaq AlMklafi

    (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia)

  • AlBandery Khalid AlMojel

    (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia)

  • Bushra AlQahtani

    (Department of Computer Science, College of Computer and Information Sciences, Saudi Arabia)

  • Moshail AlHarran

    (Department of Computer Science, College of Computer and Information Sciences, King Saud University, Saudi Arabia)

Abstract

The Maximum Clique Problem (MCP) is a classical NP-hard problem that has gained considerable attention due to its numerous real-world applications and theoretical complexity. It is inherently computationally complex, and so exact methods may require prohibitive computing time. Nature-inspired meta-heuristics have proven their utility in solving many NP-hard problems. In this research, we propose a simulated annealing-based algorithm that we call Clique Finder algorithm to solve the MCP. Our algorithm uses a logarithmic cooling schedule and two moves that are selected in an adaptive manner. The objective (error) function is the total number of missing links in the clique, which is to be minimized. The proposed algorithm was evaluated using benchmark graphs from the open-source library DIMACS, and results show that the proposed algorithm had a high success rate.

Suggested Citation

  • Sarab Almuhaideb & Najwa Altwaijry & Shahad AlMansour & Ashwaq AlMklafi & AlBandery Khalid AlMojel & Bushra AlQahtani & Moshail AlHarran, 2022. "Clique Finder: A Self-Adaptive Simulated Annealing Algorithm for the Maximum Clique Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 13(2), pages 1-22, April.
    • Handle: RePEc:igg:jamc00:v:13:y:2022:i:2:p:1-22
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.20220401.oa1
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:13:y:2022:i:2:p:1-22. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.