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

Basit Öğe Kaydı
dc.contributor.authorKarci, Ali
dc.date.accessioned2026-04-04T13:18:59Z
dc.date.available2026-04-04T13:18:59Z
dc.date.issued2025
dc.departmentİnönü Üniversitesi
dc.description9th International Artificial Intelligence and Data Processing Symposium, IDAP 2025 -- 6 September 2025 through 7 September 2025 -- Malatya -- 215321
dc.description.abstractThere 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.
dc.identifier.doi10.1109/IDAP68205.2025.11222233
dc.identifier.isbn979-833158990-5
dc.identifier.scopus2-s2.0-105025003506
dc.identifier.scopusqualityN/A
dc.identifier.urihttps://doi.org/10.1109/IDAP68205.2025.11222233
dc.identifier.urihttps://hdl.handle.net/11616/108070
dc.indekslendigikaynakScopus
dc.institutionauthorKarci, Ali
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relation.ispartof9th International Artificial Intelligence and Data Processing Symposium, IDAP 2025
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_Scopus_20250329
dc.subjectDominating Set
dc.subjectExceptions of MDSA
dc.subjectMalatya Centrality
dc.titleCoverages of Malatya Centralities for Node Neighbourhoods and its Effects on Malatya Dominating Set Algorithm
dc.typeConference Object

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu