An Effective Approach Based on the Malatya Centrality Algorithm for Determining the Maximum Independent Set and Minimum Vertex Cover in Molecular Graphs

Basit Öğe Kaydı
dc.contributor.authorYakut, Selman
dc.date.accessioned2026-04-04T13:18:59Z
dc.date.available2026-04-04T13:18:59Z
dc.date.issued2024
dc.departmentİnönü Üniversitesi
dc.description8th International Artificial Intelligence and Data Processing Symposium, IDAP 2024 -- 21 September 2024 through 22 September 2024 -- Malatya -- 203423
dc.description.abstractMolecular graphs are graphs formed by considering atoms as nodes and the connections between these atoms as edges, which constitute the structure of chemical compounds. These graphs are used to analyze the chemical and structural properties of molecules. In this study, an effective and robust approach based on the Malatya Centrality algorithm is proposed for determining the maximum independent set and the minimum vertex cover in molecular graphs. In the proposed approach, the molecular graph is transformed into a graph structure consisting of nodes and edges. Subsequently, Malatya centrality values are computed for the nodes in this graph. Using these values, the maximum independent set is first calculated for the molecular graph. Then, utilizing this set, the minimum vertex cover for the molecular graph is determined. To demonstrate the effectiveness of the proposed approach, tests and analyses were conducted on molecular graphs of various sizes, complexities, and classes. The successful test results and analyses indicate that the proposed approach is an effective and robust method for determining the maximum independent set and the minimum vertex cover in molecular graphs. © 2024 IEEE.
dc.identifier.doi10.1109/IDAP64064.2024.10710745
dc.identifier.isbn979-833153149-2
dc.identifier.scopus2-s2.0-85207867424
dc.identifier.scopusqualityN/A
dc.identifier.urihttps://doi.org/10.1109/IDAP64064.2024.10710745
dc.identifier.urihttps://hdl.handle.net/11616/108046
dc.indekslendigikaynakScopus
dc.institutionauthorYakut, Selman
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relation.ispartof8th International Artificial Intelligence and Data Processing Symposium, IDAP 2024
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_Scopus_20250329
dc.subjectChemical Graphs
dc.subjectMaximum Independent Set Problem
dc.subjectMinimum Vertex cover Problem
dc.subjectMolecular Graphs
dc.titleAn Effective Approach Based on the Malatya Centrality Algorithm for Determining the Maximum Independent Set and Minimum Vertex Cover in Molecular Graphs
dc.typeConference Object

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu