A new heuristic algorithm to solve the maximum independent set problem

DOI10.3390/MCA18030495zbMath1390.05179OpenAlexW2296404885MaRDI QIDQ1649282

Onur Ugurlu

Publication date: 5 July 2018

Published in: Mathematical \& Computational Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/mca18030495

zbMATH Keywords

optimizationmaximum independent set problemNP-hard problemsheuristics algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Uses Software

• DIMACS

This page was built for publication: A new heuristic algorithm to solve the maximum independent set problem