Verification of Karci Algorithm’s Efficiency for Maximum Independent Set Problem in Graph Theory
Computer Science · 2022
DOI: 10.53070/bbd.1090368 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Science, 2022. Verfasst von Ali KARCİ. Die Arbeit nennt 17 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
KARCİ, A. (2022). Verification of Karci Algorithm’s Efficiency for Maximum Independent Set Problem in Graph Theory. Computer Science. https://doi.org/10.53070/bbd.1090368
Vancouver
KARCİ A. Verification of Karci Algorithm’s Efficiency for Maximum Independent Set Problem in Graph Theory. Computer Science. 2022. doi:10.53070/bbd.1090368
BibTeX
@article{KARC2022,
author = {KARCİ, Ali},
title = {Verification of Karci Algorithm’s Efficiency for Maximum Independent Set Problem in Graph Theory},
journal = {Computer Science},
year = {2022},
doi = {10.53070/bbd.1090368}
}
EUVIMED