scholarly journals A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

2013 ◽  
Vol 69 (12) ◽  
pp. 38-43 ◽  
Author(s):  
Sepideh Afkhami ◽  
Omid R. Ma�rouzi ◽  
Ali Soleimani
Keyword(s):  
Search Algorithm ◽  
Harmony Search ◽  
Maximum Clique ◽  
Harmony Search Algorithm ◽  
Maximum Clique Problem ◽  
Clique Problem

scholarly journals Metric space method for constructing splitting partitions of graphs

2019 ◽  
Vol 11 (2) ◽  
pp. 131-141
Author(s):  
Sándor Szabó
Keyword(s):  
Metric Space ◽  
Numerical Experiments ◽  
Search Algorithm ◽  
Maximum Clique ◽  
Clique Number ◽  
Maximum Clique Problem ◽  
Branching Rule ◽  
The Given ◽  
Space Method ◽  
Clique Problem

Abstract In an earlier work [6] the concept of splitting partition of a graph was introduced in connection with the maximum clique problem. A splitting partition of a graph can be used to replace the graph by two smaller graphs in the course of a clique search algorithm. In other words splitting partitions can serve as a branching rule in an algorithm to compute the clique number of a given graph. In the paper we revisit this branching idea. We will describe a technique to construct not necessary optimal splitting partitions. The given graph can be viewed as a metric space and the geometry of this space plays a guiding role. In order to assess the performance of the procedure we carried out numerical experiments.

scholarly journals Dynamic Local Search for the Maximum Clique Problem

2006 ◽  
Vol 25 ◽  
pp. 159-185 ◽  
Author(s):  
W. Pullan ◽  
H. H. Hoos
Keyword(s):  
Local Search ◽  
Search Algorithm ◽  
Maximum Clique ◽  
Maximum Clique Problem ◽  
Stochastic Local Search ◽  
Performance Improvements ◽  
Benchmark Instances ◽  
Iterative Improvement ◽  
Selection Of ◽  
Clique Problem

In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which suitable vertices are added to the current clique, and plateau search, during which vertices of the current clique are swapped with vertices not contained in the current clique. The selection of vertices is solely based on vertex penalties that are dynamically adjusted during the search, and a perturbation mechanism is used to overcome search stagnation. The behaviour of DLS-MC is controlled by a single parameter, penalty delay, which controls the frequency at which vertex penalties are reduced. We show empirically that DLS-MC achieves substantial performance improvements over state-of-the-art algorithms for the maximum clique problem over a large range of the commonly used DIMACS benchmark instances.

Optimal linear cooperation spectrum sensing method based on chaos harmony search algorithm

2013 ◽  
Vol 32 (9) ◽  
pp. 2412-2417
Author(s):  
Yue-hong LI ◽  
Pin WAN ◽  
Yong-hua WANG ◽  
Jian YANG ◽  
Qin DENG
Keyword(s):  
Spectrum Sensing ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Optimal Linear
Sign in / Sign up

Export Citation Format

Share Document