Title: SOLVING THE MAXIMUM CLIQUE PROBLEM USING INTELLIGENT WATER DROPS ALGORITHM
|Year of Publication:||2012|
|Authors:||Ahmad Al-Taani , Mohammad K. Nemrawi2|
|Conference Name:||The International Conference on Computing, Networking and Digital Technologies (ICCNDT2012) - Bahrain|
In this study, we propose an Intelligent Water Drops (IWDs) approach is to solve the Maximum Clique problem (MCP). The IWDs algorithm is considered as one of the newest nature-inspired swarm-based optimization algorithms as it appears in 2007 and has a promising performance. MCP is classical problem in graph theory and it is classified as one of the NP-hard problems in computer science. Many algorithms were used to solve this problem, such as Genetic Algorithms and Ant Colony algorithm. The algorithm evaluation showed promising results.