Finding Innovative and Efficient Solutions to NP-Hard and NP-Complete Problems in Graph Theory

Ali KARCİ

Makale detayları

Finding Innovative and Efficient Solutions to NP-Hard and NP-Complete Problems in Graph Theory

Yazarlar:

Ali KARCİ

Yayıncı:

Ali KARCI

Ana Başlıklar:

Veri işleme & bilgisayar bilimi

Dergi:

Computer Science 2020 Vol.5 Issue 2, pp.137-143

Belge Tipi:

Makale

Yayın Tarihi:

11/2020

Belge Dili:

İngilizce

Document ID (Org No.):

2000895912

Sıklık:

İki Yıllık

eISSN:

2548-1304

pISSN:

2548-1304

Anahtar kelimeler:

Özet:

 

It is known that there are many NP-hard and
NP-complete problems in graph theory. The aim of this paper to prepare some
basic methods for solving such problems (min dominating set, max independent
set, max clique, etc.). In order to construct such fundamentals, the
effectiveness and ineffectiveness of all nodes in the given graph are computed.
Then these values will be used in solving NP-Hard problems of graphs.

 

It is known that there are many NP-hard and NP-complete problems in graph theory. The aim of this paper to prepare some basic methods for solving such problems (min dominating set, max independent set, max clique, etc.). In order to construct such fundamentals, the effectiveness and ineffectiveness of all nodes in the given graph are computed. Then these values will be used in solving NP-Hard problems of graphs.

Makale detayları

Finding Innovative and Efficient Solutions to NP-Hard and NP-Complete Problems in Graph Theory

Yazarlar:

Ali KARCİ

Yayıncı:

Ali KARCI

Ana Başlıklar:

Veri işleme & bilgisayar bilimi

Dergi:

Computer Science 2020 Vol.5 Issue 2, pp.137-143

Belge Tipi:

Makale

Yayın Tarihi:

11/2020

Belge Dili:

İngilizce

Document ID (Org No.):

2000895912

Sıklık:

İki Yıllık

eISSN:

2548-1304

pISSN:

2548-1304

Dominating Sets

Fundamental Cut-Sets

Efficient Algorithms

Independent Sets

Maximum Clique

Sayı

Makale detayları

Finding Innovative and Efficient Solutions to NP-Hard and NP-Complete Problems in Graph Theory

Yazarlar: Ali KARCİ

Yayıncı: Ali KARCI

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

Dergi: Computer Science 2020 Vol.5 Issue 2, pp.137-143

Belge Tipi: Makale

Yayın Tarihi: 11/2020

Belge Dili: İngilizce

Document ID (Org No.): 2000895912

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

eISSN: 2548-1304

pISSN: 2548-1304

Dominating Sets

Fundamental Cut-Sets

Efficient Algorithms

Independent Sets

Maximum Clique

Sayı

Yazarlar:

Ali KARCİ

Yayıncı:

Ali KARCI

Ana Başlıklar:

Veri işleme & bilgisayar bilimi

Dergi:

Computer Science 2020 Vol.5 Issue 2, pp.137-143

Belge Tipi:

Makale

Yayın Tarihi:

11/2020

Belge Dili:

İngilizce

Document ID (Org No.):

2000895912

Sıklık:

İki Yıllık

eISSN:

2548-1304

pISSN:

2548-1304