A New Heuristic Algorithm to Solve the Maximum Independent Set Problem
Department of Mathematics, Ege University, 35100, Bornova, Izmir, Turkey
Math. Comput. Appl. 2013, 18(3), 495-501; https://doi.org/10.3390/mca18030495
Published: 1 December 2013
Abstract
The Maximum Independent Set Problem is a classic graph optimization NPhard problem. Given a graph G=(V,E), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. In this paper, the maximum independent set problem is discussed and a new heuristic algorithm is proposed to solve this problem. The performance of the algorithm has been tested on DIMACS benchmark instances and compared with the literature works. The experimental results show that the proposed approach can yield good solutions.
Share and Cite
MDPI and ACS Style
Ugurlu, O. A New Heuristic Algorithm to Solve the Maximum Independent Set Problem. Math. Comput. Appl. 2013, 18, 495-501. https://doi.org/10.3390/mca18030495
AMA Style
Ugurlu O. A New Heuristic Algorithm to Solve the Maximum Independent Set Problem. Mathematical and Computational Applications. 2013; 18(3):495-501. https://doi.org/10.3390/mca18030495
Chicago/Turabian StyleUgurlu, Onur. 2013. "A New Heuristic Algorithm to Solve the Maximum Independent Set Problem" Mathematical and Computational Applications 18, no. 3: 495-501. https://doi.org/10.3390/mca18030495
