TY  - JOUR
T1  - The Malatya Independent Set Algorithm is Optimum
TT  - The Malatya Independent Set Algorithm is Optimum
AU  - Karci, Ali
PY  - 2025
DA  - December
Y2  - 2025
DO  - 10.53070/bbd.1776643
JF  - Computer Science
JO  - JCS
PB  - Ali KARCI
WT  - DergiPark
SN  - 2548-1304
SP  - 179
EP  - 185
VL  - 10
IS  - 2
LA  - en
AB  - Malatya Independent Set Algorithm is a greedy based algorithm, since it uses the first Malatya Centrality algorithm to find the maximum independent set for given graph. The scope of this paper is to illustrate that Malatya Independent Set Algorithm is optimum, and its process takes place for removing minimum nodes from graph as possible as for each node selection step
KW  - Malatya Centrality Algorithm
KW  - Malatya Independent Set Algorithm
KW  - Maximum Independent Set
N2  - Malatya Independent Set Algorithm is a greedy based algorithm, since it uses the first Malatya Centrality algorithm to find the maximum independent set for given graph. The scope of this paper is to illustrate that Malatya Independent Set Algorithm is optimum, and its process takes place for removing minimum nodes from graph as possible as for each node selection step
CR  - Yakut, S., Öztemiz, F., Karcı, A., (2023a)“A new robust approach to solve minimum vertex cover problem: Malatya vertex cover algorithm” The Journal of Supercomputing, Vol:79, p:19746–19769.
CR  - Yakut, S., Öztemiz, F., Karcı, A.,(2023b) ” A New Approach Based on Centrality Value in Solving the Maximum Independent Set Problem: Malatya Centrality Algorithm”, Journal of Computer Science, Vol:8, p:16-23.
CR  - Karcı, A., Yakut,S., Öztemiz, F., (2022) “A New Approach Based on Centrality Value in Solving the Minimum Vertex Cover Problem: Malatya Centrality Algorithm”, Journal of Computer Science, Vol:7, p:81-88.
CR  - Öztemiz, F., Yakut, S.,(2024a), “An Effective Method for Determining Node Dominance Values: Malatya Centrality Algorithm”, 32nd Signal Processing and Communications Applications Conference (SIU-2024).
CR  - Öztemiz, F., Yakut, S., (2024b), “Analysis of the Malatya Centrality-Based Clique Method on DIMACS Benchmarks and Random Graphs”, Malatya Turgut Ozal University Journal Of Engineering And Natural Sciences ,  vol:5, p:63-69.
CR  - Öztemiz, F., (2025a), “An Effective Algorithm for Edge Coloring: Malatya Edge Coloring Algorithm”, Turkish Journal of Science & Technology, Vol: 20, p:309-325.
CR  - Öztemiz, F., (2025b) “A greedy approach to solve maximum independent set problem: Differential Malatya independent set algorithm”, Engineering Science and Technology, an International Journal, Vol:63.
CR  - Bakan, C.T., Yakut, S., (2023) “Development of Text Summarization Method based on Graph Theory and Malatya Centrality Algorithm”, Special Issue: Journal of Computer Science, International Artificial Intelligence and Data Processing Symposium, Vol:IDAP-2023, p:90-99.
CR  - Yakut, S.(2025), “A robust and efficient algorithm for graph coloring problem based on Malatya centrality and sequent independent sets”, Egyptian Informatics Journal, Vol:30, 100676.
CR  - Okumuş, F., Karci, Ş.,(2024), “MDSA: A Dynamic and Greedy Approach to Solve the Minimum Dominating Set Problem”,Applied Science, Vol:14, https://doi.org/10.3390/app14209251.
CR  - Karci, Ş., Okumuş, F., Karci, A., (2023), “Calculating the Centrality Values According to the Strengths of Entities Relative to their Neighbours and Designing a New Algorithm for the Solution of the Minimal Dominating Set Problem“, Journal of Computer Science, Vol:8, p:50-56.
CR  - Karci, Ş., Okumuş, F., (2025), “Analytical Validation of the Malatya Dominating Set Algorithm: Constructing Optimal Dominating Sets Without Redundant Nodes”, Muş Alpaslan University Journal of Sciences, Vol:13, p:46-56, 10.18586/msufbd.1643589.
UR  - https://doi.org/10.53070/bbd.1776643
L1  - https://dergipark.org.tr/en/download/article-file/5207049
ER  -