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

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Bilgisayar Bilimleri
Volume:Volume:7 Issue:Issue:1
Verification of Karci Algorithm’s Efficiency for Maximum Independent Set Problem in Graph Theory

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

Pages : 20-28

View : 21 | Download : 7

Publication Date : 2022-06-06

Article Type : Research Paper

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

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.