Verification of Karci Algorithm’s Efficiency for Maximum Independent Set Problem in Graph Theory

Authors : Ali Karci

Pages : 20-28

Doi:10.53070/bbd.1090368

View : 18 | Download : 10

Publication Date : 2022-06-06

Article Type : Research

Abstract :The maximum independent set problem is an NP-complete problem in graph theory. The Karci Algorithm is based on fundamental cut-sets of given graph, and node with minimum independence values are selected for maximum independent set. In this study, the analytical verification of this algorithm for some special graphs was analysed, and the obtained results were explained. The verification of Karci’s Algorithm for maximum independent set was handled in partial.
Keywords : Maximum Independent Set, Karci Algorithm, NP-Complete