Next Article in Journal
Determination of the Impact Behavior of Concrete and Reinforced Concrete Beams
Previous Article in Journal
A Genetic Algorithm to Solve the Multidimensional Knapsack Problem
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
MCA
Volume 18
Issue 3
10.3390/mca18030495
mca-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with Association for Scientific Research (ASR).
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Heuristic Algorithm to Solve the Maximum Independent Set Problem

by
Onur Ugurlu
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
Versions Notes

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.
Keywords: maximum independent set problem; heuristics algorithms; optimization; NP-hard problems maximum independent set problem; heuristics algorithms; optimization; NP-hard problems

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 Style

Ugurlu, 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

APA Style

Ugurlu, O. (2013). A New Heuristic Algorithm to Solve the Maximum Independent Set Problem. Mathematical and Computational Applications, 18(3), 495-501. https://doi.org/10.3390/mca18030495

Article Metrics

Back to TopTop