Coverages of Malatya Centralities for Node Neighbourhoods and its Effects on Malatya Dominating Set Algorithm

KARCI A.

9th International Artificial Intelligence and Data Processing Symposium, IDAP 2025, Malatya, Türkiye, 6 - 07 Eylül 2025, (Tam Metin Bildiri) identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/idap68205.2025.11222233
  • Basıldığı Şehir: Malatya
  • Basıldığı Ülke: Türkiye
  • Anahtar Kelimeler: Dominating Set, Exceptions of MDSA, Malatya Centrality
  • İnönü Üniversitesi Adresli: Evet

Özet

There are many NP-Hard and NP-Complete problems in graph theory. The exact, heuristic and greedy based algorithms were developed to solve these problems. The definition series as Malatya Centralitirs were defined to solve some of these problems. In this paper, we explained the coverages of each Malatya Centrality definition, and its effect on Malatya Dominating Set Algorithm. There is an improvement in Malatya Dominating Set Algorithm, and its applications results were given in this paper.