Finding a Near-Maximum Independent Set of a Circle Graph by Using Genetic Algorithm with Conditional Genetic Operators

2008 ◽  
Author(s):  
Shu-Li Wang ◽  
Rong-Long Wang ◽  
Zhi-Qiang Chen ◽  
Kozo Okazaki
Keyword(s):  
Genetic Algorithm ◽  
Independent Set ◽  
Maximum Independent Set ◽  
Genetic Operators ◽  
Circle Graph

Parallel algorithms for finding a near-maximum independent set of a circle graph

1990 ◽  
Vol 1 (3) ◽  
pp. 263-267 ◽  
Author(s):  
Y. Takefuji ◽  
L.-L. Chen ◽  
K.-C. Lee ◽  
J. Huffman
Keyword(s):  
Parallel Algorithms ◽  
Independent Set ◽  
Maximum Independent Set ◽  
Circle Graph

scholarly journals An unconstrained binary quadratic programming for the maximum independent set problem

2012 ◽  
Vol 17 (4) ◽  
pp. 410-417
Author(s):  
Sidi Mohamed Douiri ◽  
Souad Elbernoussi
Keyword(s):  
Genetic Algorithm ◽  
Quadratic Programming ◽  
Numerical Experiments ◽  
Independent Set ◽  
Maximum Independent Set ◽  
Binary Programming ◽  
Independent Set Problem ◽  
New Model ◽  
Maximum Independent Set Problem ◽  
Unconstrained Binary Quadratic Programming

For a given graph G = (V, E) the maximum independent set problem is to find the largest subset of pairwise nonadjacent vertices. We propose a new model which is a reformulation of the maximum independent set problem as an unconstrained quadratic binary programming, and we resolve it afterward by means of a genetic algorithm. The efficiency of the approach is confirmed by results of numerical experiments on DIMACS benchmarks.

Sign in / Sign up

Export Citation Format

Share Document