Year: 2025
Type: article
Abstract: 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
Source: Computer Science
DOI: 10.53070/bbd.1776643
Author: Ali Karci
Institution: Inonu University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7118000978