Coverages of Malatya Centralities for Node Neighbourhoods and its Effects on Malatya Dominating Set Algorithm
Küçük Resim Yok
Tarih
2025
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Institute of Electrical and Electronics Engineers Inc.
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Ö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. © 2025 IEEE.
Açıklama
9th International Artificial Intelligence and Data Processing Symposium, IDAP 2025 -- 6 September 2025 through 7 September 2025 -- Malatya -- 215321
Anahtar Kelimeler
Dominating Set, Exceptions of MDSA, Malatya Centrality
Kaynak
9th International Artificial Intelligence and Data Processing Symposium, IDAP 2025
WoS Q Değeri
Scopus Q Değeri
N/A
