A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm

Yerel katalogda bu makaleye atıf yapan 17 yayın (OpenAlex referans eşleşmesi; tam dünya listesi değildir).

1. 2024 MDSA: A Dynamic and Greedy Approach to Solve the Minimum Dominating Set ProblemAtıf 11 · OpenAlex
2. 2024 MDSA: A Dynamic and Greedy Approach to Solve the Minimum Dominating Set ProblemAtıf 11 · OpenAlex
3. 2025 A greedy approach to solve maximum independent set problem: Differential Malatya independent set algorithmAtıf 7 · OpenAlex
4. 2025 A robust and efficient algorithm for graph coloring problem based on Malatya centrality and sequent independent setsAtıf 4 · OpenAlex
5. 2026 Design and Analysis of Minimum-Weighted Connected Capacitated Vertex Cover Algorithms for Link Monitoring in IoT-Enabled WSNsAtıf 3 · OpenAlex
6. 2023 İki Parçalı Eşleştirme ile Maksimum AkışAtıf 3 · OpenAlex
7. 2025 Enhancing extractive multi-documents summarization with a novel dominating set model for semantic relationship detectionAtıf 2 · OpenAlex
8. 2025 Enhancing extractive multi-documents summarization with a novel dominating set model for semantic relationship detectionAtıf 2 · OpenAlex
9. 2025 An Effective Algorithm for Edge Coloring: Malatya Edge Coloring AlgorithmAtıf 1 · OpenAlex
10. 2024 Positioning Security Cameras in The Central Transportation Networks of Barcelona With Minimum Cost via The Malatya Minimum Vertex Cover AlgorithmAtıf 1 · OpenAlex