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

Ali KARCİ

doi:https://doi.org/10.53070/bbd.1090368

Makale detayları

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

Yazarlar:

Ali KARCİ

Yayıncı:

Ali KARCI

Ana Başlıklar:

Veri işleme & bilgisayar bilimi

Dergi:

Computer Science 2022 Vol.Vol: 7 Issue Issue: 1, pp.20-28

Belge Tipi:

Makale

Yayın Tarihi:

6/2022

Belge Dili:

İngilizce

Document ID (Org No.):

2000895688

Sıklık:

İki Yıllık

eISSN:

2548-1304

pISSN:

2548-1304

DOI:

https://doi.org/10.53070/bbd.1090368

Anahtar kelimeler:

Özet:

 

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.

 

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.

Makale detayları

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

Yazarlar:

Ali KARCİ

Yayıncı:

Ali KARCI

Ana Başlıklar:

Veri işleme & bilgisayar bilimi

Dergi:

Computer Science 2022 Vol.Vol: 7 Issue Issue: 1, pp.20-28

Belge Tipi:

Makale

Yayın Tarihi:

6/2022

Belge Dili:

İngilizce

Document ID (Org No.):

2000895688

Sıklık:

İki Yıllık

eISSN:

2548-1304

pISSN:

2548-1304

DOI:

https://doi.org/10.53070/bbd.1090368

Maximum Independent Set

Karci Algorithm

NP-Complete

Sayı

Makale detayları

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

Yazarlar: Ali KARCİ

Yayıncı: Ali KARCI

Ana Başlıklar: Veri işleme & bilgisayar bilimi

Dergi: Computer Science 2022 Vol.Vol: 7 Issue Issue: 1, pp.20-28

Belge Tipi: Makale

Yayın Tarihi: 6/2022

Belge Dili: İngilizce

Document ID (Org No.): 2000895688

Sıklık: İki Yıllık

eISSN: 2548-1304

pISSN: 2548-1304

DOI: https://doi.org/10.53070/bbd.1090368

Maximum Independent Set

Karci Algorithm

NP-Complete

Sayı

Yazarlar:

Ali KARCİ

Yayıncı:

Ali KARCI

Ana Başlıklar:

Veri işleme & bilgisayar bilimi

Dergi:

Computer Science 2022 Vol.Vol: 7 Issue Issue: 1, pp.20-28

Belge Tipi:

Makale

Yayın Tarihi:

6/2022

Belge Dili:

İngilizce

Document ID (Org No.):

2000895688

Sıklık:

İki Yıllık

eISSN:

2548-1304

pISSN:

2548-1304

DOI:

https://doi.org/10.53070/bbd.1090368